Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs

References

• Agnetis, A., J. C. Billaut, S. Gawiejnowicz, D. Pacciarelli, and A. Souhal. 2014. Multi-Agent Scheduling: Models and Algorithms. Berlin: Springer.
   Google Scholar
• Agnetis, A., P. B. Mirchandani, D. Pacciarelli, and A. Pacifici. 2004. “Scheduling Problems with Two Competing Agents.” Operations Research 52 (2): 229–242. doi: 10.1287/opre.1030.0092
   Web of Science ®Google Scholar
• Agnetis, A., D. Pacciarelli, and A. Pacifici. 2007. “Multi-agent Single Machine Scheduling.” Annals of Operations Research 150 (1): 3–15. doi: 10.1007/s10479-006-0164-y
   Web of Science ®Google Scholar
• Ahmadizar, F., and J. Eteghadipour. 2017. “Single-machine Earliness-tardiness Scheduling with Two Competing Agents and Idle Time.” Engineering Optimization 49 (3): 499–512. doi: 10.1080/0305215X.2016.1190353
   Web of Science ®Google Scholar
• Allahverdi, A. 2016. “A Survey of Scheduling Problems with No-wait in Process.” European Journal of Operational Research 255 (3): 665–686. doi: 10.1016/j.ejor.2016.05.036
   Web of Science ®Google Scholar
• Arbib, C., S. Smriglio, and M. Servilio. 2004. “A Competitive Scheduling Problem and its Relevance to UMTS Channel Assignment.” Networks 44 (2): 132–141. doi: 10.1002/net.20023
   Web of Science ®Google Scholar
• Bagchi, T. P., J. N. D. Gupta, and C. Sriskandarajah. 2006. “A Review of TSP based Approaches for Flowshop Scheduling.” European Journal of Operational Research 169 (3): 816–854. doi: 10.1016/j.ejor.2004.06.040
   Web of Science ®Google Scholar
• Baker, K. R., and J. C. Smith. 2003. “A Multiple-criterion Model for Machine Scheduling.” Journal of Scheduling 6 (1): 7–16. doi: 10.1023/A:1022231419049
   Web of Science ®Google Scholar
• Čepek, O., and S. C. Sung. 2005. “A Quadratic Time Algorithm to Maximize the Number of Just-in-Time Jobs on Identical Parallel Machines.” Computers & Operations Research 32 (12): 3265–3271. doi: 10.1016/j.cor.2004.05.011
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. T. Ng, and J. J. Yuan. 2006. “Multi-agent Scheduling on a Single Machine to Minimize Total Weighted Number of Tardy Jobs.” Theoretical Computer Science 362 (1): 273–281. doi: 10.1016/j.tcs.2006.07.011
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. T. Ng, and J. J. Yuan. 2008. “Multi-agent Scheduling on a Single Machine with Max-form Criteria.” European Journal of Operational Research 188 (2): 603–609. doi: 10.1016/j.ejor.2007.04.040
   Web of Science ®Google Scholar
• Choi, B. C., and J. Chung. 2014. “Two-agent Single-machine Scheduling Problem with Just-in-Time Jobs.” Theoretical Computer Science 543: 37–45. doi: 10.1016/j.tcs.2014.05.022
   Web of Science ®Google Scholar
• Choi, B. C., and S. H. Yoon. 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
• Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of -Completeness. San Francisco, CA: W.H. Freeman.
   Google Scholar
• Gerstl, E., B. Mor, and G. Mosheiov. 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
• Gilmore, P. C., and R. E. Gomory. 1964. “Sequencing a One State-variable Machine: A Solvable Case of the Traveling Salesman Problem.” Operations Research 12 (5): 655–679. doi: 10.1287/opre.12.5.655
   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. doi: 10.1287/opre.44.3.510
   Web of Science ®Google Scholar
• Hiraishi, K., E. Levner, and M. Vlach. 2002. “Scheduling of Parallel Identical Machines to Maximize the Weighted Number of Just-in-Time Jobs.” Computers & Operations Research 29 (7): 841–848. doi: 10.1016/S0305-0548(00)00086-1
   Web of Science ®Google Scholar
• Jözefowska, J. 2007. Just-in-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems. Berlin: Springer.
   Google Scholar
• Kovalyov, M. Y., C. T. Ng, and T. C. E. Cheng. 2007. “Fixed Interval Scheduling: Models, Applications, Computational Complexity and Algorithms.” European Journal of Operational Research 178 (2): 331–342. doi: 10.1016/j.ejor.2006.01.049
   Web of Science ®Google Scholar
• Lann, A., and G. Mosheiov. 1996. “Single Machine Scheduling to Minimize the Number of Early and Tardy Jobs.” Computers & Operations Research 23 (8): 769–781. doi: 10.1016/0305-0548(95)00078-X
   Web of Science ®Google Scholar
• Lee, K., B. C. Choi, J. Y. T. Leung, and M. L. Pinedo. 2009. “Approximation Algorithms for Multi-agent Scheduling to Minimize Total Weighted Completion Time.” Information Processing Letters 109 (16): 913–917. doi: 10.1016/j.ipl.2009.04.018
   Web of Science ®Google Scholar
• Lee, W. C., S. K. Chen, C. W. Chen, and C. C. Wu. 2011. “A Two-machine Flowshop Problem with Two Agents.” Computers & Operations Research 38 (1): 98–104. doi: 10.1016/j.cor.2010.04.002
   Web of Science ®Google Scholar
• Lee, W. C., Y. H. Chung, and J. Y. Wang. 2017. “A Parallel-machine Scheduling Problem with Two Competing Agents.” Engineering Optimization 49 (6): 962–975. doi: 10.1080/0305215X.2016.1227615
   Web of Science ®Google Scholar
• Leung, J. Y. T., M. Pinedo, and G. Wan. 2010. “Competitive Two-agent Scheduling and its Applications.” Operations Research 58 (2): 458–469. doi: 10.1287/opre.1090.0744
   Web of Science ®Google Scholar
• Liao, W., X. Zhang, and M. Jiang. 2017. “Multi-objective Group Scheduling Optimization Integrated with Preventive Maintenance.” Engineering Optimization 49 (11): 1890–1904. doi: 10.1080/0305215X.2017.1280258
   Web of Science ®Google Scholar
• Liu, S. Q., and E. Kozan. 2011. “Scheduling Trains with Priorities: A No-wait Blocking Parallel-machine Job-shop Scheduling Model.” Transportation Science 45 (2): 175–198. doi: 10.1287/trsc.1100.0332
   Web of Science ®Google Scholar
• Luo, W., L. Chen, and G. Zhang. 2012. “Approximation Schemes for Two-machine Flow Shop Scheduling with Two Agents.” Journal of Combinatorial Optimization 24 (3): 229–239. doi: 10.1007/s10878-011-9378-2
   Web of Science ®Google Scholar
• Mor, B., and G. Mosheiov. 2010. “Scheduling Problems with Two Competing Agents to Minimize Minmax and Minsum Earliness Measures.” European Journal of Operational Research 206 (3): 540–546. doi: 10.1016/j.ejor.2010.03.003
   Web of Science ®Google Scholar
• Ng, C. T., T. C. E. Cheng, and J. J. Yuan. 2006. “A Note on the Complexity of the Problem of Two-agent Scheduling on a Single Machine.” Journal of Combinatorial Optimization 12 (4): 387–394. doi: 10.1007/s10878-006-9001-0
   Web of Science ®Google Scholar
• Papadimitriou, C., and M. Yannakakis. 2000. “On the Approximability of Trade-offs and Optimal Access of Web Sources.” In Proceedings of the 41st Annual Symposium on the Foundations of Computer Science, 86–92. Washington, DC: IEEE.
   Google Scholar
• Peha, J. M. 1995. “Heterogeneous-criteria Scheduling: Minimizing Weighted Number of Tardy Jobs and Weighted Completion Time.” Computers & Operations Research 22 (10): 1089–1100. doi: 10.1016/0305-0548(94)00090-U
   Web of Science ®Google Scholar
• Perez-Gonzalez, P., and J. M. Framinan. 2014. “A Common Framework and Taxonomy for Multicriteria Scheduling Problems with Interfering and Competing Jobs: Multi-agent Scheduling Problems.” European Journal of Operational Research 235 (1): 1–16. doi: 10.1016/j.ejor.2013.09.017
   Web of Science ®Google Scholar
• Pinedo, M. 2002. Scheduling: Theory, Algorithms and Systems. 2nd ed. Upper Saddle River, NJ: Prentice-Hall.
   Google Scholar
• Röck, H. 1984a. “The Three Machine No-wait Flowshop Problem is -complete.” Journal of the Association for Computing Machinery 31 (2): 336–345. doi: 10.1145/62.65
   Web of Science ®Google Scholar
• Röck, H. 1984b. “Some New Results in Flowshop Scheduling.” Zeitschrift für Operations Research 28 (1): 1–16.
   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., and Y. Bensoussan. 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., O. Dover, and M. Kaspi. 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
• Sung, S. C., and M. Vlach. 2005. “Maximizing Weighted Number of Just-in-Time Jobs on Unrelated Parallel Machines.” Journal of Scheduling 8 (5): 453–460. doi: 10.1007/s10951-005-2863-7
   Web of Science ®Google Scholar
• Wang, B., X. Han, X. Zhang, and S. Zhang. 2015. “Predictive-reactive Scheduling for Single Surgical Suite Subject to Random Emergency Surgery.” Journal of Combinatorial Optimization 30 (4): 949–966. doi: 10.1007/s10878-015-9861-2
   Web of Science ®Google Scholar
• Yin, Y., S. R. Cheng, T. C. E. Cheng, D. J. Wang, and C. C. Wu. 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
• Yuan, H., Y. Jing, J. Huang, and T. Ren. 2013. “Optimal Research and Numerical Simulation for Scheduling No-wait Flow Shop in Steel Production.” Journal of Applied Mathematics 2013: Article ID 498282. doi: 10.1155/2013/498282
   PubMed Web of Science ®Google Scholar