Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective |
| |
Authors: | Dong-Won Kim Dong-Gil Na F. Frank Chen |
| |
Affiliation: | a Department of Industrial and Systems Engineering, Chonbuk National University, Chonju, 561-756, South Korea;b Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA |
| |
Abstract: | This paper presents several search heuristics and their performance in batch scheduling of parallel, unrelated machines. Identical or similar jobs are typically processed in batches in order to decrease setup times and/or processing times. The problem accounts for allotting batched work parts into unrelated parallel machines, where each batch consists of a fixed number of jobs. Some batches may contain different jobs but all jobs within each batch should have an identical processing time and a common due date. Processing time of each job of a batch is determined according to the machine group as well as the batch group to which the job belongs. Major or minor setup times are required between two subsequent batches depending on batch sequence but are independent of machines. The objective of our study is to minimize the total weighted tardiness for the unrelated parallel machine scheduling. Four search heuristics are proposed to address the problem, namely (1) the earliest weighted due date, (2) the shortest weighted processing time, (3) the two-level batch scheduling heuristic, and (4) the simulated annealing method. These proposed local search heuristics are tested through computational experiments with data from dicing operations of a compound semiconductor manufacturing facility. |
| |
Keywords: | Unrelated parallel machine scheduling Batch scheduling Total weighted tardiness |
本文献已被 ScienceDirect 等数据库收录! |
|