| 期刊論文| 1. | Garey, M. R.、Johnson, D. S.、Sethi, R.(1976)。The complexity of flowshop and jobshop scheduling。Mathematics of Operations Research，1(2)，117-129。   | | 2. | Johnson, S. M.(1954)。Optimal two and three stage production schedules with setup times included。Naval Research Logistics Quarterly，1(1)，61-68。 | 其他| 1. | Allahverdi, A. and Aldowaisan, T.(2004)。No-wait flowshops with bicriteria of makespan and maximum lateness。 | | 2. | Chen, B., Glass, C.A., Potts, C.N. and Strusevich, V.A.(1996)。A new heuristic for three-machine flow shop scheduling。 | | 3. | Chen, J.S. and Pan, J.C.H.(2005)。Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling。 | | 4. | Giglio, R.J. and Wagner, H.M.(1964)。Approximate solutions to the three machine scheduling problem。 | | 5. | Grabowski, J.(1980)。On two-machine scheduling with release and due dates to minimize maximum lateness。 | | 6. | Grabowski, J., Skubalska, E. and Smutnicki, C.(1983)。On flow shop scheduling with release and due dates to minimize maximum lateness。 | | 7. | Gupta, J.N.D. and Reddi, S.S.(1978)。Improved dominance conditions for the three-machine flowshop scheduling problem。 | | 8. | Haouari, M. and Ladhari, T.(2000)。Minimizing maximum lateness in a two-machine flowshop。 | | 9. | Kovalyov, M.Y. and Werner, F.(1997)。A polynomial approximation scheme for the problem F2/rj/Cmax。 | | 10. | Lenstra, J.K., Rinnooy, Kan A.H.G. and Brucker, P.(1977)。Complexity of machine scheduling problems。 | | 11. | Lin, B.M.T.(2001)。Scheduling in the two-machine flowshop with due date constraints。 | | 12. | Masuda, T., Hiroaki, I. and Nishida, T.(1983)。Some bounds on approximation algorithms for n/m/I/ Lmax and n/2/F/Lmax scheduling problems。 | | 13. | Potts, C.N.(1985)。Analysis of heuristics for two-machine flow-shop sequencing subject to release dates。 | | 14. | Rajendran, C. and Ziegler, H.(2001)。A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs。 | | 15. | Szwarc, W.(1978)。Dominance conditions for the three-machine flow-shop problem。 | | 16. | Townsend, W.(1977)。Minimizing the maximum penalty in the two-machine flowshop。 | | 17. | Yanai, S. and Fujie, T.(2006)。A three-machine permutation flow-shop problem with minimum makespan on the second machine。 | | 18. | Yaurima, V., Burtseva, L. and Techernykh, A.(2009)。Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers。 | |