A heuristic algorithm for the just-in-time single machine scheduling problem with setups: a comparison with simulated annealing
Abbreviated Journal Title
Int. J. Adv. Manuf. Technol.
simulated annealing; scheduling; single machine; setup time; early-tardy; problem; common due date; COMMON DUE-DATE; SEQUENCE-DEPENDENT SETUP; COMPLETION TIMES; ABSOLUTE; DEVIATION; GENETIC ALGORITHM; JOB FAMILIES; TARDINESS; PENALTIES; PROCESSOR; EARLINESS; Automation & Control Systems; Engineering, Manufacturing
This paper addresses the single machine early/tardy problem with unrestricted common due date and sequence-dependent setup times. Two algorithms are introduced to reach near-optimum solutions: the SAPT, a heuristic tailored for the problem, and a simulated annealing (SA) algorithm. It will be shown that SA provides solutions with slightly better quality; however, SAPT requires much less computational time. SAPT-SA is a hybrid heuristic that combines both approaches to obtain high quality solutions with low computational cost. Solutions provided by the three algorithms were compared to optimal solutions for problems with up to 25 jobs and to each other for larger problems.
International Journal of Advanced Manufacturing Technology
"A heuristic algorithm for the just-in-time single machine scheduling problem with setups: a comparison with simulated annealing" (2007). Faculty Bibliography 2000s. 7548.