Multi-scenario scheduling to maximise the weighted number of just-in-time jobs

References

• Aissi, H., Aloulou, M. A., & Kovalyov, M. Y. (2011). Minimizing the number of late jobs on a single machine under due date uncertainty. Journal of Scheduling, 14(4), 351–360. doi: 10.1007/s10951-010-0183-z
   Web of Science ®Google Scholar
• Aloulou, M. A., & Croce, F. D. (2008). Complexity of single machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 36(3), 338–342. doi: 10.1016/j.orl.2007.11.005
   Web of Science ®Google Scholar
• Arkin, E., & Silverberg, E. (1987). Scheduling jobs with fixed start and finish times. Discrete Applied Mathematics, 18(1), 1–8. doi: 10.1016/0166-218X(87)90037-0
   Web of Science ®Google Scholar
• Behnamian, J. (2016). Survey on fuzzy shop scheduling. Fuzzy Optimization and Decision Making, 15(3), 331–366. doi: 10.1007/s10700-015-9225-5
   Web of Science ®Google Scholar
• Carlisle, M., & Lloyd, E. (1995). On the k-coloring of intervals. Discrete Applied Mathematics, 59(3), 225–235. doi: 10.1016/0166-218X(95)80003-M
   Web of Science ®Google Scholar
• Chen, R. X., & Li, S. S., & Li, W. L. (2018). Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs. Engineering Optimization, to Appear. doi: 10.1080/0305215X.2018.1458844
   Google Scholar
• Čepek, O., & Sung, S. (2005). A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers and Operations Research, 32(12), 3265–3271. doi: 10.1016/j.cor.2004.05.011
   Web of Science ®Google Scholar
• Choi, B. C., & Yoon, S. H. (2007). Maximizing the weighted number of just-in-time jobs in flow-shop scheduling. Journal of Scheduling, 10(4–5), 237–243. doi: 10.1007/s10951-007-0030-z
   Web of Science ®Google Scholar
• Chung, D. Y., & Choi, B. C. (2013). Just-in-time scheduling under scenario-based uncertainty. Asia-Pacific Journal of Operational Research, 30(02), 1250055. doi: 10.1142/S0217595912500558
   Web of Science ®Google Scholar
• de Farias, I. R., Zhao, H., & Zhao, M. (2010). A family of inequalities valid for the robust single machine scheduling polyhedron. Computers and Operations Research, 37(9), 1610–1614. doi: 10.1016/j.cor.2009.12.001
   Web of Science ®Google Scholar
• Elalouf, A., Levner, E., & Tang, H. (2013). An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. Journal of Scheduling, 16(4), 429–435. doi: 10.1007/s10951-013-0320-6
   Web of Science ®Google Scholar
• Emmons, H., & Pinedo, M. (1990). Scheduling stochastic jobs with due dates on parallel machines. European Journal of Operational Research, 47(1), 49–55. doi: 10.1016/0377-2217(90)90088-S
   Web of Science ®Google Scholar
• Gerstl, E., Mor, B., & Mosheiov, G. (2015). A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Information Processing Letters, 115(2), 159–162. doi: 10.1016/j.ipl.2014.09.004
   Web of Science ®Google Scholar
• Glazebrook, K. D. (1979). Scheduling tasks with exponential service times on parallel processors. Journal of Applied Probability, 16(03), 685–689. doi: 10.1017/S0021900200107843
   Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
   Google Scholar
• Hiraishi, K., Levner, E., & Vlach, M. (2002). Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers and Operations Research, 29(7), 841–848. doi: 10.1016/S0305-0548(00)00086-1
   Web of Science ®Google Scholar
• Iscibuchi, H., Yamamoto, M., Misaki, S., & Tanaka, H. (1994). Local Search Algorithms for Flow Shop Scheduling with Fuzzy Due-Dates. International Journal of Production Economics, 33, 53–66. doi: 10.1016/0925-5273(94)90118-X
   Web of Science ®Google Scholar
• Ishii, H., & Tada, M. (1995). Single machine scheduling with fuzzy relation. European Journal of Operational Research, 47, 49–55.
   Google Scholar
• Kampke, T. (1989). Optimal scheduling of jobs with exponential service times on identical parallel machines. Operations Research, 37, 126–133.
   Web of Science ®Google Scholar
• Kasperski, A., & Zieliński, P. (2016). Single machine scheduling problems with uncertain parameters and the OWA criterion. Journal of Scheduling, 19(2), 177–190. doi: 10.1007/s10951-015-0444-y
   Web of Science ®Google Scholar
• Kung, H., Luccio, F., & Preparata, F. (1975). On finding the maxima of a set of vectors. Journal of the Acm, 22(4), 469–476. doi: 10.1145/321906.321910
   Web of Science ®Google Scholar
• Lann, A., & Mosheiov, G. (1996). Single machine scheduling to minimize the number of early and tardy jobs. Computers and Operations Research, 23(8), 769–781. doi: 10.1016/0305-0548(95)00078-X
   Web of Science ®Google Scholar
• Leyvand, Y., Shabtay, D., Steiner, G., & Yedidsion, L. (2010). Just-in-time scheduling with controllable processing times on parallel machines. Journal of Combinatorial Optimization, 19(3), 347–368. doi: 10.1007/s10878-009-9270-5
   Web of Science ®Google Scholar
• Mosheiov, G., & Shabtay, D. (2013). Maximizing the weighted number of just-in-time jobs on a single machine with position dependent processing times. Journal of Scheduling, 16(5), 519–527. doi: 10.1007/s10951-013-0327-z
   Web of Science ®Google Scholar
• Petrovic, S., Fayad, C., Petrovic, D., Burke, E., & Kendall, G. (2008). Fuzzy job shop scheduling with lot-sizing. Annals of Operations Research, 159(1), 275–292. doi: 10.1007/s10479-007-0287-9
   Web of Science ®Google Scholar
• Shabtay, D. (2012). The just-in-time scheduling problem in a flow-shop scheduling system. European Journal of Operational Research, 216(3), 521–532. doi: 10.1016/j.ejor.2011.07.053
   Web of Science ®Google Scholar
• Shabtay, D., & Bensoussan, Y. (2012). Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. Journal of Scheduling, 15(1), 39–47. doi: 10.1007/s10951-010-0204-y
   Web of Science ®Google Scholar
• Shabtay, D., Dover, O., & Kaspi, M. (2015). Single-machine two-agent scheduling involving a just-in-time criterion. International Journal of Production Research, 53(9), 2590–2604. doi: 10.1080/00207543.2014.970706
   Web of Science ®Google Scholar
• Skutella, M., Sviridenko, M., & Uetz, M. (2016). Unrelated machine scheduling with stochastic processing times. Mathematics of Operations Research, 41(3), 851–864. doi: 10.1287/moor.2015.0757
   Web of Science ®Google Scholar
• Sotskov, Y. N., & Werner, F. (2014). Sequencing and scheduling with inaccurate data. Hauppauge, NY: Nova Science Publishers.
   Google Scholar
• T’kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: Theory, models and algorithms. 2nd ed. Berlin: Springer.
   Google Scholar
• Yang, J., & Yu, G. (2002). On the robust single machine scheduling problem. Journal of Combinatorial Optimization, 6(1), 17–33.
   Web of Science ®Google Scholar
• Yin, Y., Cheng, S. R., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2016). Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega, 63, 41–47. doi: 10.1016/j.omega.2015.09.010
   Web of Science ®Google Scholar
• Yin, Y., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2017). Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs. Journal of Scheduling, 20(4), 313–335. doi: 10.1007/s10951-017-0511-7
   Web of Science ®Google Scholar
• Weiss, G., & Pinedo, M. (1980). Scheduling tasks with exponential service times on non identical processors to minimize various cost functions. Journal of Applied Probability, 17(01), 187–202. doi: 10.2307/3212936
   Web of Science ®Google Scholar