Variable neighborhood search for the single machine scheduling problem to minimize the total early work

DOI10.1007/s11590-022-01913-6MaRDI QIDQ6063510

Saïd Hanafi, Rachid Benmansour, Raca Todosijević

Publication date: 7 November 2023

Published in: Optimization Letters (Search for Journal in Brave)

zbMATH Keywords

schedulingdynamic programmingvariable neighborhood searchearly work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
• Nested general variable neighborhood search for the periodic maintenance problem
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
• A single machine scheduling problem to minimize total early work
• Minimizing the number of tardy job units under release time constraints
• Variable neighborhood search
• General variable neighborhood search for computing graph separators
• General variable neighborhood search for the order batching and sequencing problem
• Variable neighborhood search: basics and variants
• Less is more: general variable neighborhood search for the capacitated modular hub location problem
• Mirror scheduling problems with early work and late work criteria
• Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• Single Machine Scheduling to Minimize Total Late Work
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Handbook on Scheduling
• Variable neighborhood search: Principles and applications

This page was built for publication: Variable neighborhood search for the single machine scheduling problem to minimize the total early work