A Linear Programming Approach for Parallel Cell Scheduling with Sequence-Dependent Setup Times

• 作者: ?lker Kü?üko?lu Alk?n Yurtkuran Besim Türker ?zalp Nursel ?ztürk Tu?ba Y?ld?z
• 来源期刊: 美国运筹学期刊(英文)
• 学科: 医学
• 关键词: Production SCHEDULING Total COMPLETION Time SEQUENCE DEPENDENT SETUP TIMES
• 年，卷（期）: 2014,（3）
• 页码范围: 155-163
• 页数: 9页
• 分类号: R73

摘要

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.