Batching and resource allocation decisions on an m-machine proportionate flowshop

References

• Agnetis, A., & Mosheiov, G. (2017). Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optimization Letters, 11(4), 885–892.
   Web of Science ®Google Scholar
• Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70(3), 335–341.
   Web of Science ®Google Scholar
• Allahverdi, A., Ng, C. T., Cheng, T. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.
   Web of Science ®Google Scholar
• Bellanger, A., & Oulamara, A. (2009). Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers and Operations Research, 36(6), 1982–1992.
   Web of Science ®Google Scholar
• Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & Van de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1(1), 31–54.
   Google Scholar
• Chandru, V., Lee, C.-Y., & Uzsoy, R. (1993a). Minimizing total completion time on batch processing machines. International Journal of Production Research, 31(9), 2097–2122.
   Web of Science ®Google Scholar
• Chandru, V., Lee, C.-Y., & Uzsoy, R. (1993b). Minimizing total completion time on batch processing machines. Operations Research Letters, 13(2), 61–65.
   Web of Science ®Google Scholar
• Choi, B. C., Yoon, S. H., & Chung, S. J. (2007). Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research, 176(2), 964–974.
   Web of Science ®Google Scholar
• Fan, W., Pei, J., Liu, X., Pardalos, P. M., & Kong, M. (2017). Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. Forthcoming Journal of Global Optimization, 71, 147–163.
   Web of Science ®Google Scholar
• Gong, H., Tang, L., & Duin, C. W. (2010). A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Computers and Operations Research, 37(5), 960–969.
   Web of Science ®Google Scholar
• Hochbaum, D. S., & Landy, D. (1993). Algorithms and heuristics for scheduling semiconductor burn-in-operations, Technical report, Engineering Systems Research Center, University of California, Berkeley.
   Google Scholar
• Janiak, A. (1989). Minimization of blooming mills standstills - mathematical model, suboptimal algorithms. Mechanika, 8(2), 37–49.
   Google Scholar
• Janiak, A., & Kovalyov, M. Y. (1996). Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research, 94(2), 284–291.
   Web of Science ®Google Scholar
• Kaspi, M., & Shabtay, D. (2003). Optimization of machining economics problem for a multi-stage transfer machine under failure, opportunistic and integrated replacement strategies. International Journal of Production Research, 41(10), 2229–2248.
   Web of Science ®Google Scholar
• Monma, C. L., Schrijver, A., Todd, M. J., & Wei, V. K. (1990). Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions. Mathematics of Operations Research, 15(4), 736–748.
   Web of Science ®Google Scholar
• Ng, C. T., Cai, X., Cheng, T. C. E., & Lam, S. S. (2005). Minimizing completion time variance with compressible processing times. Journal of Global Optimization, 31(2), 333–352.
   Web of Science ®Google Scholar
• Oron, D. (2011). Scheduling a batching machine with convex resource consumption functions. Information Processing Letters, 111(19), 962–967.
   Web of Science ®Google Scholar
• Panwalker, S. S., Dudek, R. A., & Smith, M. L. (1973). Sequencing research and the industrial problem. In Elmaghraby, S.E. (ed.), Symposium on the theory of scheduling and its applications (pp. 29–38). Berlin: Springer.
   Google Scholar
• Panwalkar, S. S., & Koulamas, C. (2017). On the dominance of permutation schedules for some ordered and proportionate flow shop problems. Computers and Industrial Engineering, 107, 105–108.
   Web of Science ®Google Scholar
• Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2017a). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research. doi:10.1007/s10479-017-2481-8
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Fan, W., Pardalos, P. M., & Lu, S. (2019). A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega, 82, 55–69.
   Web of Science ®Google Scholar
• Pei, J., Pardalos, P. M., Liu, X., Fan, W., & Yang, S. (2015). Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. European Journal of Operational Research, 244(1), 13–25.
   Web of Science ®Google Scholar
• Pinedo, M. (2008). Scheduling: Theory, algorithms and systems (3rd ed.). Englewood Cliffs, NJ: Prentice-Hall.
   Google Scholar
• Shabtay, D., & Oron, D. (2016). Proportionate flow-shop scheduling with rejection. Journal of the Operational Research Society, 67(5), 752–769.
   Web of Science ®Google Scholar
• Shabtay, D., & Steiner, G. (2007). A survery of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643–1666.
   Web of Science ®Google Scholar
• Shakhlevich, N., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1(3), 157–168.
   Google Scholar
• Vickson, R. G. (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3), 258–262.
   Web of Science ®Google Scholar
• Voß, S., & Witt, A. (2007). Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application. International Journal of Production Economics, 105(2), 445–458.
   Web of Science ®Google Scholar