Trade-off balancing between maximum and total completion times for no-wait flow shop production

References

• Aldowaisan, Tariq, and Ali Allahverdi. 2004. “New Heuristics for M-machine No-wait Flowshop to Minimize Total Completion Time.” Omega 32 (5): 345–352. doi: 10.1016/j.omega.2004.01.004
   Web of Science ®Google Scholar
• Allahverdi, Ali. 2016. “A Survey of Scheduling Problems with No-Wait in Process.” European Journal of Operational Research 255: 665–686. doi: 10.1016/j.ejor.2016.05.036
   Web of Science ®Google Scholar
• Allahverdi, Ali, and Tariq Aldowaisan. 2002. “No-wait Flowshops with Bicriteria of Makespan and Total Completion Time.” Journal of the Operational Research Society 53 (9): 1004–1015. doi: 10.1057/palgrave.jors.2601403
   Web of Science ®Google Scholar
• Allahverdi, Ali, and Harun Aydilek. 2013. “Algorithms for No-wait Flowshops with Total Completion Time Subject to Makespan.” International Journal of Advanced Manufacturing Technology 68: 2237–2251. doi: 10.1007/s00170-013-4836-x
   Web of Science ®Google Scholar
• Allahverdi, Ali, and Harun Aydilek. 2014. “Total Completion Time with Makespan Constraint in No-wait Flowshops with Setup Times.” European Journal of Operational Research 238 (3): 724–734. doi: 10.1016/j.ejor.2014.04.031
   Web of Science ®Google Scholar
• Allahverdi, Ali, Harun Aydilek, and Asiye Aydilek. 2018. “No-wait Flowshop Scheduling Problem with Two Criteria; Total Tardiness and Makespan.” European Journal of Operational Research 269 (2): 590–601. doi: 10.1016/j.ejor.2017.11.070
   Web of Science ®Google Scholar
• Aydilek, Harun, and Ali Allahverdi. 2012. “Heuristics for No-wait Flowshops with Makespan Subject to Mean Completion Time.” Applied Mathematics and Computation 219 (1): 351–359. doi: 10.1016/j.amc.2012.06.024
   Web of Science ®Google Scholar
• Bertolissi, Edy. 2000. “Heuristic Algorithm for Scheduling in the No-wait Flow-shop.” Journal of Materials Processing Technology 107 (1): 459–465. doi: 10.1016/S0924-0136(00)00720-2
   Web of Science ®Google Scholar
• Chen, Chuen-Lung, Ranga V. Neppalli, and Nasser Aljaber. 1996. “Genetic Algorithms Applied to the Continuous Flow Shop Problem.” Computers & Industrial Engineering 30 (4): 919–929. doi: 10.1016/0360-8352(96)00042-3
   Web of Science ®Google Scholar
• Chien, Chen-Fu, John W. Fowler, Zhibin Jiang, Shekar Krishnaswamy, Tae-Eog Lee, Lars Moench, and Reha Uzsoy. 2011. “Modelling and Analysis of Semiconductor Manufacturing in a Shrinking World: Challenges and Successes.” European Journal of Industrial Engineering 5 (3): 254–271. doi: 10.1504/EJIE.2011.041616
   Web of Science ®Google Scholar
• Ciavotta, Michele, Gerardo Minella, and Rubén Ruiz. 2013. “Multi-objective Sequence Dependent Setup Times Permutation Flowshop: A New Algorithm and a Comprehensive Study.” European Journal of Operational Research 227 (2): 301–313. doi: 10.1016/j.ejor.2012.12.031
   Web of Science ®Google Scholar
• Cohn, Amy, Selin Kurnaz, Yihan Guan, and Yiwen Jiang. 2010. “Trading Off Between Makespan and Customer Responsiveness in Flow Shop Sequencing.” International Journal of Production Research 48 (22): 6777–6797. doi: 10.1080/00207540903280531
   Web of Science ®Google Scholar
• Cortés, Beatriz Murrieta, Juan Carlos Espinoza García, and Fabiola Regis Hernández. 2012. “Multi-objective Flow-shop Scheduling with Parallel Machines.” International Journal of Production Research 50 (10): 2796–2808. doi: 10.1080/00207543.2011.593006
   Web of Science ®Google Scholar
• Czyzżak, Piotr, and Adrezej Jaszkiewicz. 1998. “Pareto Simulated Annealing – a Metaheuristic Technique for Multiple-objective Combinatorial Optimization.” Journal of Multi-Criteria Decision Analysis 7 (1): 34–47. doi: 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6
   Google Scholar
• Dang, Feidi. 2017. “An Efficient Heuristic to Balance Trade-offs between Utlization and Patient Flowtimes in Operating Room Management.” Master's thesis, University of Kentucky.
   Google Scholar
• Fink, Andreas, and Stefan Voß. 2003. “Solving the Continuous Flow-shop Scheduling Problem by Metaheuristics.” European Journal of Operational Research 151 (2): 400–414. doi: 10.1016/S0377-2217(02)00834-2
   Web of Science ®Google Scholar
• Framinan, Jose Manuel, Rainer Leisten, and Rafael Ruiz-Usano. 2002. “Efficient Heuristics for Flowshop Sequencing with the Objectives of Makespan and Flowtime Minimisation.” European Journal of Operational Research 141 (3): 559–569. doi: 10.1016/S0377-2217(01)00278-8
   Web of Science ®Google Scholar
• Framinan, José Manuel, and Marcelo Seido Nagano. 2008. “Evaluating the Performance for Makespan Minimisation in No-wait Flowshop Sequencing.” Journal of Materials Processing Technology 197 (1): 1–9. doi: 10.1016/j.jmatprotec.2007.07.039
   Web of Science ®Google Scholar
• Framinan, José Manuel, Marcelo Seido Nagano, and João Vitor Moccellin. 2010. “An Efficient Heuristic for Total Flowtime Minimisation in No-wait Flowshops.” The International Journal of Advanced Manufacturing Technology 46 (9–12): 1049–1057. doi: 10.1007/s00170-009-2154-0
   Web of Science ®Google Scholar
• Gangadharan, Rajesh, and Chandrasekharan Rajendran. 1993. “Heuristic Algorithms for Scheduling in the No-wait Flowshop.” International Journal of Production Economics 32 (3): 285–290. doi: 10.1016/0925-5273(93)90042-J
   Web of Science ®Google Scholar
• Gupta, Diwakar. 2007. “Surgical Suites' Operations Management.” Production and Operations Management 16 (6): 689–700. doi: 10.1111/j.1937-5956.2007.tb00289.x
   Web of Science ®Google Scholar
• Hsu, Vernon Ning, Renato De Matta, and Chung-Yee Lee. 2003. “Scheduling Patients in an Ambulatory Surgical Center.” Naval Research Logistics (NRL) 50 (3): 218–238. doi: 10.1002/nav.10060
   Web of Science ®Google Scholar
• Johnson, D. S., and Michael R. Garey. 1979. Computers andIntractability. New York: W. II. Freeman and Company.
   Google Scholar
• Jungwattanakit, Jitti, Manop Reodecha, Paveena Chaovalitwongse, and Frank Werner. 2009. “A Comparison of Scheduling Algorithms for Flexible Flow Shop Problems with Unrelated Parallel Machines, Setup Times, and Dual Criteria.” Computers & Operations Research 36 (2): 358–378. doi: 10.1016/j.cor.2007.10.004
   Web of Science ®Google Scholar
• Laha, Dipak, and Uday K. Chakraborty. 2009. “A Constructive Heuristic for Minimizing Makespan in No-wait Flow Shop Scheduling.” The International Journal of Advanced Manufacturing Technology 41 (1–2): 97–109. doi: 10.1007/s00170-008-1454-0
   Web of Science ®Google Scholar
• Laha, Dipak, and Jatinder N. D. Gupta. 2016. “A Hungarian Penalty-based Construction Algorithm to Minimize Makespan and Total Flow Time in No-wait Flow Shops.” Computers & Industrial Engineering98: 373–383. doi: 10.1016/j.cie.2016.06.003
   Web of Science ®Google Scholar
• Laha, Dipak, Jatinder N. D. Gupta, and Sagar U. Sapkal. 2014. “A Penalty-shift-insertion-based Algorithm to Minimize Total Flow Time in No-wait Flow Shops.” Journal of the Operational Research Society 65 (10): 1611–1624. doi: 10.1057/jors.2013.118
   Web of Science ®Google Scholar
• Laha, Dipak, and Sagar U. Sapkal. 2014. “An Improved Heuristic to Minimize Total Flow Time for Scheduling in the M-machine No-wait Flow Shop.” Computers & Industrial Engineering 67: 36–43. doi: 10.1016/j.cie.2013.08.026
   Web of Science ®Google Scholar
• Li, Wei, Victoria L. Mitchell, and Barrie R. Nault. 2014. “Inconsistent Objectives in Operating Room Scheduling.” Proceedings of the 2014 Industrial and Systems Engineering Research Conference. May 31–June 3, 2014, Montreal, QC, Canada.
   Google Scholar
• Li, Wei, Barrie R. Nault, and Honghan Ye. 2019. “Trade-off Balancing in Scheduling for Flow Shop Production and Perioperative Processes.” European Journal of Operational Research 273 (3): 817–830. doi: 10.1016/j.ejor.2018.08.048
   Web of Science ®Google Scholar
• Li, Junqing, Hongyan Sang, Yuyan Han, Cungang Wang, and Kaizhou Gao. 2018. “Efficient Multi-objective Optimization Algorithm for Hybrid Flow Shop Scheduling Problems with Setup Energy Consumptions.” Journal of Cleaner Production 181: 584–598. doi: 10.1016/j.jclepro.2018.02.004
   Web of Science ®Google Scholar
• Li, Xiaoping, Qian Wang, and Cheng Wu. 2008. “Heuristic for No-wait Flow Shops with Makespan Minimization.” International Journal of Production Research 46 (9): 2519–2530. doi: 10.1080/00207540701737997
   Web of Science ®Google Scholar
• Montgomery, Douglas C. 2007. Introduction to Statistical Quality Control. Hoboken, NJ, USA: John Wiley & Sons.
   Google Scholar
• Nawaz, Muhammad, E. Emory Enscore, and Inyong Ham. 1983. “A Heuristic Algorithm for the M-machine, N-job Flow-shop Sequencing Problem.” Omega 11 (1): 91–95. doi: 10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• Pan, Quan-Ke, Ling Wang, and Bin Qian. 2009. “A Novel Differential Evolution Algorithm for Bi-criteria No-wait Flow Shop Scheduling Problems.” Computers & Operations Research 36 (8): 2498–2511. doi: 10.1016/j.cor.2008.10.008
   Web of Science ®Google Scholar
• Rajendran, Chandrasekharan. 1994. “A No-wait Flowshop Scheduling Heuristic to Minimize Makespan.” Journal of the Operational Research Society 45 (4): 472–478. doi: 10.1057/jors.1994.65
   Web of Science ®Google Scholar
• Rajendran, Chandrasekharan, and Dipak Chaudhuri. 1990. “Heuristic Algorithms for Continuous Flow-shop Problem.” Naval Research Logistics (NRL) 37 (5): 695–705. doi: 10.1002/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L
   Web of Science ®Google Scholar
• Rajendran, Chandrasekharan, and Hans Ziegler. 1997. “An Efficient Heuristic for Scheduling in a Flowshop to Minimize Total Weighted Flowtime of Jobs.” European Journal of Operational Research103 (1): 129–138. doi: 10.1016/S0377-2217(96)00273-1
   Web of Science ®Google Scholar
• Reddi, S. S., and C. V. Ramamoorthy. 1972. “On the Flow-shop Sequencing Problem with No Wait in Process.” Journal of the Operational Research Society 23 (3): 323–331. doi: 10.1057/jors.1972.52
   Google Scholar
• Röck, Hans. 1984. “The Three-machine No-wait Flow Shop is NP-complete.” Journal of the ACM (JACM) 31 (2): 336–345. doi: 10.1145/62.65
   Web of Science ®Google Scholar
• Ruiz, Rubén, and Ali Allahverdi. 2009. “New Heuristics for No-wait Flow Shops with a Linear Combination of Makespan and Maximum Lateness.” International Journal of Production Research 47 (20): 5717–5738. doi: 10.1080/00207540802070942
   Web of Science ®Google Scholar
• Samarghandi, Hamed, and Tarek Y. ElMekkawy. 2012. “A Meta-heuristic Approach for Solving the No-wait Flow-shop Problem.” International Journal of Production Research 50 (24): 7313–7326. doi: 10.1080/00207543.2011.648277
   Web of Science ®Google Scholar
• Shao, Weishi, Dechang Pi, and Zhongshi Shao. 2019. “A Pareto-based Estimation of Distribution Algorithm for Solving Multiobjective Distributed No-wait Flow-shop Scheduling Problem with Sequence-Dependent Setup Time.” IEEE Transactions on Automation Science and Engineering. doi:10.1109/TASE.2018.2886303.
   Web of Science ®Google Scholar
• Taillard, Eric. 1993. “Benchmarks for Basic Scheduling Problems.” European Journal of Operational Research 64 (2): 278–285. doi: 10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., A. R. Rahimi-Vahed, and A. H. Mirzaei. 2008. “Solving a Multi-objective No-wait Flow Shop Scheduling Problem with an Immune Algorithm.” The International Journal of Advanced Manufacturing Technology 36 (9–10): 969–981. doi: 10.1007/s00170-006-0906-7
   Web of Science ®Google Scholar
• Tian, Ye, Ran Cheng, Xingyi Zhang, Fan Cheng, and Yaochu Jin. 2018. “An Indicator-based Multiobjective Evolutionary Algorithm with Reference Point Adaptation for Better Versatility.” IEEE Transactions on Evolutionary Computation 22 (4): 609–622. doi: 10.1109/TEVC.2017.2749619
   Web of Science ®Google Scholar
• Wu, Kan, and Leon McGinnis. 2012. “Performance Evaluation for General Queueing Networks in Manufacturing Systems: Characterizing the Trade-off Between Queue Time and Utilization.” European Journal of Operational Research 221 (2): 328–339. doi: 10.1016/j.ejor.2012.03.019
   Web of Science ®Google Scholar
• Xu, Zhitao, X. G. Ming, Maokuan Zheng, Miao Li, Lina He, and Wenyan Song. 2015. “Cross-trained Workers Scheduling for Field Service Using Improved NSGA-II.” International Journal of Production Research 53 (4): 1255–1272. doi: 10.1080/00207543.2014.955923
   Web of Science ®Google Scholar
• Ye, Honghan, Wei Li, and Amin Abedini. 2017. “An Improved Heuristic for No-wait Flow Shop to Minimize Makespan.” Journal of Manufacturing Systems 44: 273–279. doi: 10.1016/j.jmsy.2017.04.007
   Web of Science ®Google Scholar
• Ye, Honghan, Wei Li, Amin Abedini, and Barrie Nault. 2017. “An Effective and Efficient Heuristic for No-wait Flow Shop Production to Minimize Total Completion Time.” Computers & Industrial Engineering 108: 57–69. doi: 10.1016/j.cie.2017.04.002
   Web of Science ®Google Scholar
• Ye, Honghan, Wei Li, and Enming Miao. 2016. “An Effective Heuristic for No-wait Flow Shop Production to Minimize Makespan.” Journal of Manufacturing Systems 40: 2–7. doi: 10.1016/j.jmsy.2016.05.001
   Web of Science ®Google Scholar
• Zhao, Hui, Kan Wu, and Edward Huang. 2018. “Clinical Trial Supply Chain Design Based on the Pareto-optimal Trade-off Between Time and Cost.” IISE Transactions 50 (6): 512–524. doi: 10.1080/24725854.2017.1395978
   Web of Science ®Google Scholar