Simultaneous minimisation of mean and variation of waiting times in a two-stage proportionate blocking flow shop

References

• Bagchi, U. (1989). Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems. Operations Research, 37(1), 118–125. https://doi.org/10.1287/opre.37.1.118
   Web of Science ®Google Scholar
• Ben-Yehoshua, Y., Hariri, E., & Mosheiov, G. (2015). A note on minimizing total absolute deviation of job completion times on a two-machine no-wait proportionate flow shop. International Journal of Production Research, 53(19), 5717–5724. https://doi.org/10.1080/00207543.2014.991843
   Web of Science ®Google Scholar
• Cai, X. (1995). Minimization of agreeably weighted variance in single machine systems. European Journal of Operational Research, 85(3), 576–592. https://doi.org/10.1016/0377-2217(93)E0367-7
   Web of Science ®Google Scholar
• De, P., Ghosh, J. B., & Wells, C. E. (1992). On the minimization of completion time variance with a bicriteria extension. Operations Research, 40(6), 1148–1155. https://doi.org/10.1287/opre.40.6.1148
   Web of Science ®Google Scholar
• Ding, J. Y., Song, S., Gupta, J. N., Wang, C., Zhang, R., & Wu, C. (2016). New block properties for flow shop scheduling with blocking and their application in an iterated greedy algorithm. International Journal of Production Research, 54(16), 4759–4772. https://doi.org/10.1080/00207543.2015.1076941
   Web of Science ®Google Scholar
• Dong, J., Pan, H., Ye, C., Tong, W., & Hu, J. (2021). No-wait two-stage flowshop problem with multi-task flexibility of the first machine. Information Sciences, 544, 25–38.
   Web of Science ®Google Scholar
• Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations Research, 12(5), 655–679. https://doi.org/10.1287/opre.12.5.655
   Web of Science ®Google Scholar
• Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3), 510–525. https://doi.org/10.1287/opre.44.3.510
   Web of Science ®Google Scholar
• Hardy, G. H., Littlewood, J. E., & Polya, G. (1967). Inequalities. Cambridge University Press.
   Google Scholar
• Hwang, F. J., & Lin Bertrand, M. T. (2016). Two-stage flexible flow shop scheduling subject to fixed job sequences. Journal of the Operational Research Society, 67(3), 506–515. https://doi.org/10.1057/jors.2015.61
   Web of Science ®Google Scholar
• Kamal Abadi, I. N., Hall, N. G., & Sriskandarajah, C. (2000). Minimizing cycle time in a blocking flowshop. Operations Research, 48(1), 177–180. https://doi.org/10.1287/opre.48.1.177.12451
   Web of Science ®Google Scholar
• Kanet, J. J. (1981). Minimizing variation of flow time in single machine systems. Management Science, 27(12), 1453–1459. https://doi.org/10.1287/mnsc.27.12.1453
   Web of Science ®Google Scholar
• Koulamas, C. (2011). A unified solution approach for the due date assignment problem with tardy jobs. International Journal of Production Economics, 132(2), 292–295. https://doi.org/10.1016/j.ijpe.2011.04.023
   Web of Science ®Google Scholar
• Koulamas, C., & Kyparisis, G. J. (2022a). Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection. European Journal of Operational Research (to appear) https://doi.org/10.1016/j.ejor.2022.06.025
   Web of Science ®Google Scholar
• Koulamas, C., & Kyparisis, G. J. (2022b). A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems. European Journal of Operational Research (to appear) https://doi.org/10.1016/j.ejor.2022.03.043
   Web of Science ®Google Scholar
• Kovalev, S., Kovalyov, M. Y., Mosheiov, G., & Gerstl, E. (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. https://doi.org/10.1080/00207543.2018.1468097
   Web of Science ®Google Scholar
• Kubiak, W. (1993). Completion time variance minimization on a single machine is difficult. Operations Research Letters, 14(1), 49–59. https://doi.org/10.1016/0167-6377(93)90019-D
   Web of Science ®Google Scholar
• Merten, A. G., & Muller, M. E. (1972). Variance minimization in single machine sequencing problems. Management Science, 18(9), 518–528. https://doi.org/10.1287/mnsc.18.9.518
   Web of Science ®Google Scholar
• Miyata, H. H., & Nagano, M. S. (2019). The blocking flow shop scheduling problem: A comprehensive and conceptual review. Expert Systems with Applications, 137, 130–156. https://doi.org/10.1016/j.eswa.2019.06.069
   Web of Science ®Google Scholar
• Panwalkar, S. S., & Koulamas, C. (2015). On equivalence between the proportionate flow shop and single‐machine scheduling problems. Naval Research Logistics, 62(7), 595–603. https://doi.org/10.1002/nav.21666
   Web of Science ®Google Scholar
• Panwalkar, S. S., & Koulamas, C. (2020). Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines. Journal of Scheduling, 23(1), 145–154. https://doi.org/10.1007/s10951-019-00618-6
   Web of Science ®Google Scholar
• Panwalkar, S. S., & Koulamas, C. (2021). New results for minimizing variation of flow time in two-machine proportionate no-wait flow shops. International Journal of Production Research, 59(9), 2789–2799. https://doi.org/10.1080/00207543.2020.1740345
   Web of Science ®Google Scholar
• Panwalkar, S. S., Smith, M. L., & Koulamas, C. (2013). Review of the ordered and proportionate flow shop scheduling research. Naval Research Logistics, 60(1), 46–55. https://doi.org/10.1002/nav.21518
   Web of Science ®Google Scholar
• Rock, H. (1984). Some new results in flow shop scheduling. Mathematical Methods of Operations Research, 28(1), 1–16.
   Google Scholar
• Soylu, B., Kirca, Ö., & Azizoğlu, M. (2007). Flow shop-sequencing problem with synchronous transfers and makespan minimization. International Journal of Production Research, 45(15), 3311–3331. https://doi.org/10.1080/00207540600621672
   Web of Science ®Google Scholar
• Waldherr, S., & Knust, S. (2015). Complexity results for flow shop problems with synchronous movement. European Journal of Operational Research, 242(1), 34–44. https://doi.org/10.1016/j.ejor.2014.09.053
   Web of Science ®Google Scholar
• Wang, D., Qiu, H., Wu, C. C., Lin, W. C., Lai, K., & Cheng, S. R. (2019). Dominance rule and opposition-based particle swarm optimization for two-stage assembly scheduling with time cumulated learning effect. Soft Computing, 23(19), 9617–9628. https://doi.org/10.1007/s00500-018-3525-y
   Web of Science ®Google Scholar
• Woeginger, G. H. (1999). An approximation scheme for minimizing agreeably weighted variance on a single machine. Informs Journal on Computing, 11(2), 211–216. https://doi.org/10.1287/ijoc.11.2.211
   Web of Science ®Google Scholar
• Woeginger, G. H. (2000). When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? Informs Journal on Computing, 12(1), 57–74. https://doi.org/10.1287/ijoc.12.1.57.11901
   Web of Science ®Google Scholar