A heuristic hybrid framework for vector job scheduling

DOI10.2298/YJOR150416013AzbMath1474.90135MaRDI QIDQ4987672

Nareyus I. Lawrance Amaldass, Nenad Mladenović, Cormac Lucas

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingschedulingvariable neighborhood searchant colony optimization

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• Attraction probabilities in variable neighborhood search
• Variable neighborhood search
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Benchmarks for basic scheduling problems
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
• An algorithm for the single machine sequencing problem with precedence constraints
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• Handbook of metaheuristics
• Dynamic programming algorithms for scheduling parallel machines with family setup times

This page was built for publication: A heuristic hybrid framework for vector job scheduling