A Linear Programming Approach for Parallel Cell Scheduling with Sequence-Dependent Setup Times ()
ABSTRACT
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.
Share and Cite:
Yıldız, T. , Özalp, B. , Küçükoğlu, İ. , Yurtkuran, A. and Öztürk, N. (2014) A Linear Programming Approach for Parallel Cell Scheduling with Sequence-Dependent Setup Times.
American Journal of Operations Research,
4, 155-163. doi:
10.4236/ajor.2014.43015.
Cited by
No relevant information.