Research Reports from the Department of Operations
Document Type
Dissertation
Publication Date
5-26-1969
Abstract
This research considers two and three machine static flow shop scheduling problems in which exactly one of the machines is characterized by sequence dependent setup times. Based on both the number of machines involved and the position of this particular machine in the shop, five different problems can be identified. The optimality of permutation schedules for each of these problems is investigated. Then, a dynamic programming algorithm for obtaining an optimal permutation schedule is developed for each problem. The computational requirements of each of these algorithms are discussed. Finally, a branch and bound algorithm for obtaining an optimal permutation schedule is developed for each problem. The results of computational experience with one of these algorithms is given.
Keywords
Operations research, Scheduling--Mathematical models, Production scheduling, Dynamic programming, Branch and bound algorithms
Publication Title
Dissertation, Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 150 ; Submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy.
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Corwin, Burton D., "Some Flow Shop Scheduling Problems Involving Sequence Dependent Setup Times" (1969). Research Reports from the Department of Operations. 537.
https://commons.case.edu/wsom-ops-reports/537