Efficient algorithms for machine scheduling problems with earliness and tardiness penalties

DOI10.1007/s10479-007-0284-zzbMath1156.90362OpenAlexW2016104601MaRDI QIDQ940876

Hoong Chuin Lau, Guang Feng

Publication date: 3 September 2008

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

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/1195

zbMATH Keywords

schedulingearliness-tardinessmeta-heuristicssqueaky wheel

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Energy cost efficient scheduling in flexible job-shop manufacturing systems, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, Multi-coloring and job-scheduling with assignment and incompatibility costs, Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Solving a Class Scheduling Problem with a Genetic Algorithm