Article
Keywords:
flow-shop; case study; integer programming; heuristics
Summary:
References:
[1] Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., Weglarz, J.:
Scheduling Computer and Manufacturing Processes. Springer–Verlag, Berlin 1996.
Zbl 0911.90201
[2]
Y. Cho, S. Sahni: Preemptive scheduling of independent jobs with release and due times on open, flow and job shops.Oper. Res. 29 (1981), 3, 511–522.
MR 0629191 |
Zbl 1170.01413
[3] Kubzin, M., Strusevich, A.:
Planning machine maintenance in two-machine shop scheduling. Oper. Res. 54, 4, 2006, 789–800.
Zbl 1167.90669
[4]
J. K. Lenstra and A. H. G. Rinnooy Kan: Complexity of scheduling under precedence constraints.Oper. Res. 26 (1978), 1, 22–35.
MR 0462553 |
Zbl 1195.33045