Article
A case study in parallel unrelated machine scheduling: A heuristic approach
Journal of Manufacturing Systems
(1987)
Abstract
This article describes a heuristic algorithm that generates weekly production schedules for packaging a number of products on parallel unrelated lines. Various constraints are imposed, including restrictions on the total number of lines that can run simultaneously, product families that can be processed concurrently, total run hours per shift, and available material. Special consideration is given to weekly startup learning coefficients, changeover learning coefficients, changeover times, shutdown hours, and a host of other factors. The objective is to maximize weekly output or to minimize the time to produce weekly demand, whichever is applicable.
Keywords
- Machine Scheduling,
- Heuristic Algorithms,
- Decision Support Systems,
- Production Schedules
Disciplines
Publication Date
1987
DOI
10.1016/0278-6125(87)90047-1
Citation Information
M. I. Dessouky, Yasser Dessouky and M. M. Dessouky. "A case study in parallel unrelated machine scheduling: A heuristic approach" Journal of Manufacturing Systems Vol. 6 Iss. 1 (1987) p. 23 - 36 Available at: http://works.bepress.com/yasser_dessouky/22/