Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed

References

• Aldowaisan, T., and A. Allahverdi. 2012. “Minimizing Total Tardiness in no-wait Flowshops.” Foundations of Computing and Decision Sciences 37: 149–162.
   Google Scholar
• Allahverdi, A. 2016. “A Survey of Scheduling Problems with no-wait in Process.” European Journal of Operational Research 255 (3): 665–686.
   Web of Science ®Google Scholar
• Arabameri, S., and N. Salmasi. 2013. “Minimization of Weighted Earliness and Tardiness for no-wait Sequence-Dependent Setup Times Flowshop Scheduling Problem.” Computers and Industrial Engineering 64 (4): 902–916.
   Web of Science ®Google Scholar
• Baker, K. R. 1974. Introduction to Sequencing and Scheduling. New York: Wiley.
   Google Scholar
• Baker, K. R., and J. W. M. Bertrand. 1982. “A Dynamic Priority Rule for Scheduling Against Due-Dates.” Journal of Operations Management 3 (1): 37–42.
   Google Scholar
• Baker, K. R., and G. D. Scudder. 1990. “Sequencing with Earliness and Tardiness Penalties: A Review.” Operations Research 38: 22–36.
   Web of Science ®Google Scholar
• Chandra, C., Mehta, P., and D. Tirupati. 2009. “Permutation Flow Shop Scheduling with Earliness and Tardiness Penalties.” International Journal of Production Research 47: 5591–5610.
   Web of Science ®Google Scholar
• Davis, J. S., and J. J. Kanet. 1993. “Single-Machine Scheduling with Early and Tardy Completion Costs.” Naval Research Logistics 40: 85–101.
   Web of Science ®Google Scholar
• Ding, J., S. Song, R. Zhang, J. N. D. Gupta, and C. Wu. 2015. “Accelerated Methods for Total Tardiness Minimization in no-wait Flowshops.” International Journal of Production Research 53 (4): 1002–1018.
   Web of Science ®Google Scholar
• Fernandez-Viagas, V., M. Dios, and J. M. Framinan. 2016. “Efficient Constructive and Composit Heuristics for the Permutation Flowshop to Minimize Total Earliness and Tardiness.” Computers and Operations Research 70: 38–68.
   Web of Science ®Google Scholar
• Framinan, J. M., M. S. Nagano, and J. V. Moccellin. 2010. “An Efficient Heuristic for Total Flowtime Minimization in no-wait Flowshops.” The International Journal of Advanced Manufacturing Technology 46 (9–12): 1049–1057.
   Web of Science ®Google Scholar
• Fry, T. D., R. D. Armstrong, and J. H. Blackstone. 1987. “Minimizing Weighted Absolute Deviation in Single Machine Scheduling.” IIE Transactions 9: 445–450.
   Web of Science ®Google Scholar
• Gao, F., M. Liu, J. Wang, and Y. Lu. 2018. “No-wait Two-Machine Permutation Flow Shop Scheduling Problem with Learning Effect, Common due Date and Controllable job Processing Times.” International Journal of Production Research 56 (6): 2361–2369.
   Web of Science ®Google Scholar
• Gao, K., Q. Pan, and J. Li. 2011. “Discrete Harmony Search Algorithm for the no-wait Flow Shop Scheduling Problem with Total Flow Time Criterion.” The International Journal of Advanced Manufacturing Technology 56 (5–8): 683–692.
   Web of Science ®Google Scholar
• Gao, J., X. Zhu, K. Bai, and R. Zhang. 2021. “New Controllable Processing Time Scheduling with Subcontracting Strategy for no-wait Job Shop Problem.” International Journal of Production Research. doi: 10.1080/00207543.2021.1886368.
   Web of Science ®Google Scholar
• Hall, N. G., and C. Sriskandarajah. 1996. “A Survey of Machine Scheduling Problems with Blocking and no-wait in Process.” Operations Research 44 (3): 510–525.
   Web of Science ®Google Scholar
• Hoogeveen, H. 2005. “Multicriteria Scheduling.” European Journal of Operational Research 167: 592–623.
   Web of Science ®Google Scholar
• Jackson, J. R. 1955. “Scheduling a Production Line to Minimize Maximum Tardiness.” In Research Report 43, Management Science Research Project. Los Angeles: University of California.
   Google Scholar
• Javadi, B., M. Saidi-Mehrabad, A. Haji, I. Mahdavi, F. Jolai, and N. Mahdavi-Amiri. 2008. “No-wait Flow Shop Scheduling Using Fuzzy Multi-Objective Linear Programming.” The Journal of the Franklin Institute 345: 452–467.
   Web of Science ®Google Scholar
• Kanet, J. J., and V. Sridharan. 2000. “Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review.” Operations Research 48: 99–110.
   Web of Science ®Google Scholar
• Kim, Y. D., and C. A. Yano. 1994. “Minimizing Mean Tardiness and Earliness in Single-Machine Scheduling Problems with Unequal due Dates.” Naval Research Logistics 41: 913–933.
   Web of Science ®Google Scholar
• Koulamas, C., and G. J. Kyparisis. 2021. “The no-wait Flow Shop with Rejection.” International Journal of Production Research 59 (6): 1852–1859. doi: 10.1080/00207543.2020.1727042.
   Web of Science ®Google Scholar
• Kovalev, S., M. L. Kovalyov, G. Mosheiov, and E. Gerstl. 2019. “Semi-V-shape Property for Two-Machine no-wait Proportionate Flow Shop Problem with TADC Criterion.” International Journal of Production Research 57 (2): 560–566.
   Web of Science ®Google Scholar
• Laha, D., and U. 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.
   Web of Science ®Google Scholar
• Liu, G., S. Song, and W. Cheng. 2013. “Some Heuristics for no-wait Flowshops with Total Tardiness Criterion.” Computers and Operations Research 40 (2): 521–525.
   Web of Science ®Google Scholar
• Madhushini, N., C. Rajendran, and Y. Deepa. 2009. “Branch-and-bound Algorithms for Scheduling in Permutation Flowshops to Minimize the sum of Weighted Flowtime/sum of Weighted Tardiness/sum of Weighted Flowtime and Weighted Tardiness/sum of Weighted Flowtime, Weighted Tardiness and Weighted Earliness of Jobs.” Journal of the Operational Research Society 40: 991–1004.
   Web of Science ®Google Scholar
• Meng, L., C. Zhang, X. Shao, B. Zhang, Y. Ren, and W. Lin. 2020. “More MILP Models for Hybrid Flow Shop Scheduling Problem and its Extended Problems.” International Journal of Production Research 58 (13): 3905–3930. doi: 10.1080/00207543.2019.163632.
   Web of Science ®Google Scholar
• M’Hallah, R. 2014. “An Iterated Local Search Variable Neighborhood Descent Hybrid Heuristic for the Total Earliness Tardiness Permutation Flow Shop.” International Journal of Production Research 52 (13): 3802–3819.
   Web of Science ®Google Scholar
• Moslehi, G., M. Mirzaee, M. Vasei, and A. Azaron. 2009. “Two-machine Flow Shop Scheduling to Minimize the sum of Maximum Earliness and Tardiness.” International Journal of Production Economics 122: 763–773.
   Web of Science ®Google Scholar
• Ow, P. S., and T. E. Morton. 1989. “The Single-Machine Early Tardy Problem.” Management Science 35 (2): 177–191.
   Web of Science ®Google Scholar
• Pan, Q., L. Wang, and B. Zhao. 2008. “An Improved Iterated Greedy Algorithm for the no-wait Flow Shop Scheduling Problem with Makespan Criterion.” The International Journal of Advanced Manufacturing Technology 38 (7–8): 778–786.
   Web of Science ®Google Scholar
• Panwalkar, S. S., and W. Iskander. 1977. “Survey of Scheduling Rules.” Operations Research 25 (1): 45–61.
   Web of Science ®Google Scholar
• Qi, X., H. Wang, H. Zhu, J. Zhang, F. Chen, and J. Yang. 2016. “Fast Local Neighborhood Search Algorithm for the no-wait Flow Shop Scheduling with Total Flow Time Minimization.” International Journal of Production Research 54 (16): 4957–4972.
   Web of Science ®Google Scholar
• Rajendran, C. 1999. “Formulations and Heuristics for Scheduling in a Kanban Flowshop to Minimize the sum of Weighted Flowtime, Weighted Tardiness and Weighted Earliness of Containers.” International Journal of Production Research 37: 1137–1158.
   Web of Science ®Google Scholar
• Samarghandi, H. 2015. “A Particle Swarm Optimisation for the no-wait Flow Shop Problem with due Date Constraints.” International Journal of Production Research 53 (9): 2853–2870.
   Web of Science ®Google Scholar
• Schaller, J. E. 2007. “A Comparison of Lower Bounds for the Single-Machine Early Tardy Problem.” Computers and Operations Research 34: 2279–2292.
   Web of Science ®Google Scholar
• Schaller, J. E. 2011. “Pull Systems: An Essential Lean Element at Mercury Wire and OFS Sturbridge.” Target 27 (2): 34–42.
   Google Scholar
• Schaller, J. E., and J. M. Valente. 2013a. “An Evaluation of Heuristics for Scheduling a non-Delay Permutation Flow Shop with Family Setups to Minimize Total Earliness and Tardiness.” Journal of the Operational Research Society 64 (6): 805.
   Web of Science ®Google Scholar
• Schaller, J. E., and J. M. Valente. 2013b. “A Comparison of Metaheuristic Procedures to Schedule Jobs in a Permutation Flow Shop to Minimise Total Earliness and Tardiness.” The International Journal of Production Research 51 (3): 772.
   Web of Science ®Google Scholar
• Schaller, J. E., and J. M. Valente. 2019. “Heuristics for Scheduling Jobs in a Permutation Flow Shop to Minimize Total Earliness with Unforced Idle Time Allowed.” Expert Systems With Applications 119: 76–386.
   Web of Science ®Google Scholar
• Schaller, J. E., and J. M. Valente. 2020. “Minimizing Total Earliness and Tardiness in a Nowait Flow Shop.” International Journal of Production Economics 224: 107542.
   Web of Science ®Google Scholar
• Smith, W. E. 1956. “Various Optimizers for Single-Stage Production.” Naval Research Logistics Quarterly 3: 59–66.
   Google Scholar
• Sun, X., X. N. Geng, J. B. Wang, and F. Liu. 2019. “Convex Resource Allocation Scheduling in a no-wait Flow Shop with Common Flow Allowance and Learning Effect.” International Journal of Production Research 57 (6): 1873–1891.
   Web of Science ®Google Scholar
• Valente, J. M. S. 2007. “Dispatching Heuristics for the Single Machine Early/Tardy Scheduling Problem with job-Independent Penalties.” Computers & Industrial Engineering 52 (4): 434–447.
   Web of Science ®Google Scholar
• Valente, J. M. S. 2009. “Beam Search Heuristics for the Single Machine Scheduling Problem with Linear Earliness and Quadratic Tardiness Costs.” Asia-Pacific Journal of Operational Research 26: 319–339.
   Web of Science ®Google Scholar
• Valente, J. M. S., and R. A. F. S. Alves. 2005. “Improved Heuristics for the Early/Tardy Scheduling Problem with no Idle Time.” Computers & Operations Research 32 (3): 557–569.
   Web of Science ®Google Scholar
• Vepsalainen, A. P. J., and T. E. Morton. 1987. “Priority Rules for Job Shops with Weighted Tardiness Costs.” Management Science 33 (8): 1035–1047.
   Web of Science ®Google Scholar
• Wang, S., M. Liu, and C. Chu. 2015. “A Branch-and-Bound Algorithm for two-Stage no-wait Hybrid Flow-Shop Scheduling, International Journal of Production Research.” Volume 53 (4): 1143–1167.
   Google Scholar
• Zegordi, S. H., K. Itoh, and T. Enkawa. 1995. “A Knowledgeable Simulated Annealing Scheme for the Early/Tardy Flow Shop Scheduling Problem.” International Journal of Production Research 33: 1449–1466.
   Web of Science ®Google Scholar