By Topic

Scheduling unrelated parallel machines to minimize total weighted tardiness

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dong-Gil Na ; Electron. & Telecommun. Res. Inst., Daejeon ; Dong-Won Kim ; Wooseung Jang ; Chen, F.F.

This paper addresses the batch scheduling problem of unrelated parallel machines attempting to minimize the total weighted tardiness. Identical or similar jobs are typically processed in batches to decrease setup and/or processing times. Local dispatching rules such as the earliest weighted due date, the shortest weighted processing time, and the earliest weighted due date with a process utilization spread are tailored to the batch scheduling requirements. Based on the features of batch scheduling, a two-level batch scheduling framework is suggested. Existing heuristics, which show excellent performance in terms of total weighted tardiness for the single machine scheduling, such as the modified earliest due date rule and the modified cost over time rule, are extended for the problem. The simulated annealing algorithm as a meta-heuristic is also presented to obtain near optimal solutions. The proposed heuristics are compared through computational experiments with data from the dicing process of a compound semiconductor manufacturing facility

Published in:

Service Operations and Logistics, and Informatics, 2006. SOLI '06. IEEE International Conference on

Date of Conference:

21-23 June 2006