1 |
Kim, Y.-D.; "A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops", Computers and Opteration Reasearch, 20(4) :391-401, 1993.
DOI
ScienceOn
|
2 |
Choi, S.-W. and Kim, Y.-D.; "Minimizing total tardiness on a two-machine re-entrant flowshop," Journal of the Operational Research Society, 199(2) : 375-384, 2009.
DOI
ScienceOn
|
3 |
Della Croce, F., Narayan, V., and Tadei, R.; "The two-machine total completion time flow shop problem," European Journal of Operational Research, 90(2) : 227-237, 1996.
DOI
ScienceOn
|
4 |
Demirkol, E. and Uzsoy, R.; "Decomposition methods for reentrant flow shops with sequence dependent setup times," Journal of Scheduling, 3(3) : 115-177, 2000.
|
5 |
Graves, S. C., Meal, H. C., Stefek, D., and Zeghmi, A. H.; "Scheduling of re-entrant flow shops," Journal of Operations Management, 3(4) : 197-207, 1983.
DOI
ScienceOn
|
6 |
Hoogeveen, J. A. and van de Velde, S. L.; "Stronger Lagrangean bounds by use of slack variables : Application to machine scheduling problems," Mathematical Programming, 70(1-3) : 173-190, 1995.
DOI
ScienceOn
|
7 |
Ignall, E. and Schrage, L. E.; "Application of the branchandbound technique to some flow shop problems," Operations Research, 13(3) : 400-412, 1965.
DOI
ScienceOn
|
8 |
Nawaz, M., Enscore, E. E., and Ham, I.; "A heuristic algorithm for the m-machine, n-job flow-shop scheduling problem," Omega, 11(1) : 91-95, 1983.
DOI
ScienceOn
|
9 |
Pan, J. C. H. and Chen, J. S.; "Minimizing makespan in re-entrant permutation flow-shops," Journal of Operational Research Society, 54(6) : 642-653, 2003.
DOI
ScienceOn
|
10 |
van de Velde, S. L.; "Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangean relaxation," Annals of Operations Research, 26(1) : 257-268, 1990.
|
11 |
Baker, K. R.; Introduction to Sequencing and Scheduling. John Wiley and Sons: New York, 148-152, 1974.
|
12 |
Choi, S.-W. and Kim, Y.-D.; "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, 58(7) : 972-981, 2007.
DOI
ScienceOn
|
13 |
Choi, S.-W. and Kim, Y.-D.; "Minimizing makespan on an m-machine re-entrant flowshop," Computers and Operations Research, 35(5) : 1684-1696, 2008.
DOI
ScienceOn
|