Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
Resource
European Journal of Operational Research 196 (1): 78-92
Journal
European Journal of Operational Research
Journal Volume
196
Journal Issue
1
Pages
78-92
Date Issued
2009
Author(s)
Chiang, Tsung-Che
Abstract
This paper addresses the job shop scheduling problem to minimize the number of tardy jobs, considering the sequence dependent setup time. This problem is taken as a sequencing problem, and a family of approaches with different levels of intricacy is proposed. The simplest form is a critical ratio-based dispatching rule, which leads to satisfactory solutions by taking into account the group information rather than only the individual information of jobs. Then, an enhanced approach consisting of an iterative schedule refining mechanism will be given. Its feature is to iteratively adjust the estimation of the remaining processing times of jobs in a dynamic and operation-specific manner. Finally, a genetic algorithm which takes the dispatching rule and the refining mechanism as the core is proposed. The performance of these approaches is carefully examined by a comprehensive experimental study. © 2008 Elsevier B.V. All rights reserved.
Subjects
Dispatching rules; Genetic algorithms; Job shop; Scheduling; Sequence dependent setup
Other Subjects
Algorithms; Diesel engines; Genetic algorithms; Refining; Scheduling; Critical ratios; Dispatching rules; Experimental studies; Iterative schedules; Job shop; Job shops; Job-shop scheduling problems; Number of tardy jobs; Paper addresses; Processing times; Refining mechanisms; Satisfactory solutions; Sequence dependent setup; Sequence dependents; Sequencing problems; Setup times; Mobile telecommunication systems
Type
journal article