In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained.
A Linear Programming Approach for Parallel Cell Scheduling with Sequence-Dependent Setup Times
Tuğba Yıldız,Besim Türker Özalp,Ilker Küçükoglu,A. Yurtkuran,N. Öztürk
Published 2014 in American Journal of Operations Research
ABSTRACT
PUBLICATION RECORD
- Publication year
2014
- Venue
American Journal of Operations Research
- Publication date
2014-04-30
- Fields of study
Mathematics, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-11 of 11 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1