A simulated annealing algorithm for single machine scheduling problems with family setups

Authors:
Feng Jin;Shiji Song;Cheng Wu
Affiliations:
Department of Automation, Tsinghua University, Beijing 100084, PR China and Shanghai Baosight Software Co., Ltd., Shanghai 201203, PR China;Department of Automation, Tsinghua University, Beijing 100084, PR China;Department of Automation, Tsinghua University, Beijing 100084, PR China
Venue:
Computers and Operations Research
Year:
2009

Citing 4
Cited 4

Single-machine scheduling with release dates, due dates and family setup times

Management Science
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard

Journal of Scheduling
Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times

Computers and Operations Research
Batch scheduling to minimize maximum lateness

Operations Research Letters

Scheduling with families of jobs and delivery coordination under job availability

Theoretical Computer Science
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

Applied Soft Computing
A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups

Computers and Operations Research
A differential evolution approach for NTJ-NFSSP with SDSTs and RDs

ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Motivated by the real-life scheduling problem in a steel-wire factory in China, this paper studies the problem of minimizing the maximum lateness on a single machine with family setups. In view of the NP-hard nature of the problem, neighborhood properties of the problem are investigated. It is found that the traditional move-based neighborhood is inefficient to search. Then a new neighborhood, which is based on batch destruction and construction, is developed. A simulated annealing algorithm with the new neighborhood is proposed. Experiments are carried out on the randomly generated problems and the real-life instances from a factory in China. Computational results show that the proposed algorithm can obtain better near optimal solutions than the existing algorithm.