Journal
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
Volume 18, Issue 3-4, Pages 223-231Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0736-5845(02)00013-3
Keywords
parallel machine scheduling; total tardiness; simulated annealing
Ask authors/readers for more resources
This paper presents a scheduling problem for unrelated parallel machines with sequence-dependent setup times, using simulated annealing (SA). The problem accounts for allotting work parts of L jobs into M parallel unrelated machines, where a job refers to a lot composed of N items. Some jobs may have different items while every item within each job has an identical processing time with a common due date. Each machine has its own processing times according to the characteristics of the machine as well as job types. Setup times are machine independent but job sequence dependent. SA, a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness. The suggested SA method utilizes six job or item rearranging techniques to generate neighborhood solutions. The experimental analysis shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardiness. (C) 2002 Elsevier Science Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available