期刊論文| 1. | Johnson, S. M.(1954)。Optimal two- and three-stage production schedules with setup times included。Naval Research Logistics Quarterly，1(1)，61-68。   |
| 2. | Ying, Kuo-ching、Lin, Shih-wei(20130900)。A High-Performing Constructive Heuristic for Minimizing Makespan in Permutation Flowshops。工業工程學刊，30(6)，355-362。 |
| 3. | Wang, S.、Liu, M.、Chu, C.(2015)。A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling。Int J Prod Res，53，1143-1167。 |
| 4. | Dileepan, P.(2004)。A note on minimizing maximum lateness in a two-machine no-wait flowshop。Comput Oper Res，31，2111-2115。 |
| 5. | Chang, J. L.、Shao, H. H.(2005)。Heuristic algorithm for two-machine no-wait flowshop scheduling problem。Comput Integr Manuf Syst，11，1147-1153。 |
| 6. | Su, L. H.、Lee, Y. Y.(2008)。The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time。Comput Oper Res，35，2952-2963。 |
| 7. | Akhshabi, M.、Tavakkoli-Moghaddam, R.、Rahnamay-Roodposhti, F.(2014)。A hybrid particle swarm optimization algorithm for a no-wait flow-shop scheduling problem with the total flow time。Int J Adv Manuf Technol，70，1181-1188。 |
| 8. | Kacem, I.、Haouari, M.(2009)。Approximation algorithms for single machine scheduling with one unavailability period。Q J Oper Res，7，79-92。 |
| 9. | Wang, G. Q.、Cheng, T. C. E.(2001)。Heuristics for two-machine no-wait flowshop scheduling with an availability constraint。Inf Process Lett，80，305-309。 |
| 10. | Cheng, T. C. E.、Liu, Z. H.(2003)。Approximability of two-machine no-wait flowshop scheduling with availability constraints。Oper Res Lett，31，319-322。 |
| 11. | Cheng, T. C. E.、Liu, Z. H.(2003)。3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints。Inf Process Lett，88，161-165。 |
| 12. | Allaoui, H.、Artiba, A.、Elmaghraby, S. E.、Riane, F.(2006)。Scheduling of a two-machine flowshop with availability constraints on the first machine。Int J Prod Econ，99，16-27。 |
| 13. | Chihaoui, F. B.、Kacem, I.、Hadj-Alouane, A. B.(2011)。No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates。Int J Prod Res，49，6273-6286。 |
| 14. | Rabiee, M.、Zandieh, M.、Jafarian, A.(2012)。Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics。Int J Prod Res，50，1969-2016。 |
| 15. | Kubzin, M. A.、Strusevich, V. A.(2004)。Two-machine flow-shop nowait scheduling with a nonavailability interval。Nav Res Log，51，613-631。 |
| 16. | Espinouse, M. L.、Formanowicz, P.、Penz, B.(1999)。Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability。Comput Ind Eng，37，497-500。 |
| 17. | Glass, C. A.、Gupta, J. N. D.、Potts, C. N.(1999)。Two-machine no-wait flow shop scheduling with missing operations。Math Oper Res，24，911-924。 |
| 18. | Zhao, C.、Tang, H.(2011)。A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints。Optim Lett，5，183-190。 |
| 19. | Gomory, R. E.、Gilmore, P. C.(1964)。Sequencing a one state variable machine: a solvable case of the traveling salesman problem。Operations Research，12，655-679。 |