Article
Scheduling to minimize makespan when a changeover penalty exists
Journal of Manufacturing Systems
(1990)
Abstract
This paper presents a technique for minimizing makespan when a changeover penalty exists for adjacently scheduling incompatible jobs. Makespan is defined as the time elapsed from the onset of the first job to the completion of the last one. The changeover effect depends on the degree of compatibility between the families of jobs before and after changeover. To study this situation, a parallel unrelated machine system is examined. A heuristic solution of the problem is developed and then used in a statistical experiment to test its performance. Both the demand of the jobs and their production rates supply the necessary input, which the heuristic method utilizes for the expression of the changeover learning coefficients. The results show that when changeover is an important factor, this particular heuristic approach performs significantly better than others which also address the parallel unrelated machine problem. Less adequate heuristics require minor modifications in order to provide them with capability for directly addressing the changeover issue.
Keywords
- Scheduling with Changeover Penalty,
- Adjacent Incompatible Job Scheduling,
- Parallel Unrelated Machine Scheduling,
- Makespan Minimization
Disciplines
Publication Date
1990
DOI
10.1016/0278-6125(90)90028-G
Citation Information
Yasser Dessouky and Gerald T. Mackulak. "Scheduling to minimize makespan when a changeover penalty exists" Journal of Manufacturing Systems Vol. 9 Iss. 2 (1990) p. 139 - 150 ISSN: 0278-6125 Available at: http://works.bepress.com/yasser_dessouky/21/