1 |
Baker, K. R. and Trietsch, D. (2009), Flow shop scheduling, Principles of sequencing and scheduling, John Wiley and Sons, 225-249.
|
2 |
Chen, B., Potts, C. N., and Woeginger, G. J. (1993), A review of machine scheduling: complexity, algorithms and approximability, Handbook of Combinatorial Optimization, Springer US, 1493-1641.
|
3 |
Garey, M. R. and Johnson, D. S. (1979), Computers and intractibility: a guide to the theory of NP-completeness, New York: W. H. Freeman and Co.
|
4 |
Garey, M. R., Johnson, D. S., and Sethi, R. (1976), The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117-129.
DOI
|
5 |
Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G. (1979), Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 5, 287-326.
DOI
|
6 |
Hoogeveen, J. A. and Kawaguchi, T. (1999), Minimizing total completion time in a two-machine flowshop:analysis of special cases, Mathematics of Operations Research, 24, 887-910.
DOI
|
7 |
Johnson, S. M. (1954), Optimal two- and three-stage production with setup times included, Naval Research Quarterly, 61-68.
|
8 |
Lenstra, J. K., Rinnooy Kan, A. H. G., and Brucker, P. (1977), Complexity of machine scheduling problems, Annals of Discrete Mathematics, 1, 343-362.
DOI
|
9 |
Yang, J. (2013), No Tardiness Rescheduling with Order Disruptions, Industrial Engineering and Management Systems, 12, 51-62.
DOI
|
10 |
Yang, J. (2015), Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage, Industrial Engineering and Management Systems, 14, 22-31.
DOI
|