201
Views
10
CrossRef citations to date
0
Altmetric
Original Articles

Multitasking scheduling problems with two competitive agents

ORCID Icon, &
Pages 1940-1956 | Received 25 Mar 2019, Accepted 07 Oct 2019, Published online: 13 Nov 2019

References

  • Agnetis, A., J. C. Billaut, S. Gawiejnowicz, D. Pacciarelli, and A. Souhal. 2014. Multi-agent Scheduling: Models and Algorithms. Berlin: Springer.
  • Agnetis, A., P. B. Mirchandani, D. Pacciarelli, and A. Pacifici. 2004. “Scheduling Problems with Two Competing Agents.” Operations Research 52 (2): 229–242.
  • Agnetis, A., D. Pacciarelli, and A. Pacifici. 2007. “Multi-agent Single Machine Scheduling.” Annals of Operations Research 150 (1): 3–15.
  • Ahmadizar, F., and J. Eteghadipour. 2017. “Single-machine Earliness-tardiness Scheduling with Two Competing Agents and Idle Time.” Engineering Optimization 49 (3): 499–512.
  • Baker, K. R, and J. C. Smith. 2003. “A Multiple-Criterion Model for Machine Scheduling.” Journal of Scheduling 6 (1): 7–16.
  • Brucker, P. 2007. Scheduling Algorithms. 5th ed. Berlin: Springer.
  • Chen, R. X., S. S. Li, and W. J. Li. 2018. “Multi-agent Scheduling in a No-wait Flow Shop System to Maximize the Weighted Number of Just-in-Time Jobs.” Engineering Optimization 51 (2): 217–230.
  • Chen, R. B., J. J. Yuan, and Y. Gao. 2019. “The Complexity of CO-agent Scheduling to Minimize the Total Completion Time and Total Number of Tardy Jobs.” Journal of Scheduling 22 (5): 581–593.
  • 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-3): 273–281.
  • 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.
  • Diwas Singh, K. C. 2014. “Does Multitasking Improve Performance? Evidence from the Emergency Department.” Manufacturing & Service Operations Management 16 (2): 168–183.
  • Fan, B. Q., T. C. E. Cheng, S. S. Li, and Q. Feng. 2013. “Bounded Parallel-Batching Scheduling with Two Competing Agents.” Journal of Scheduling 16 (3): 261–271.
  • Hall, N. G., J. Y. T. Leung, and C. L. Li. 2015. “The Effects of Multitasking on Operations Scheduling.” Production and Operations Management 24 (8): 1248–1265.
  • Hall, N. G., J. Y. T. Leung, and C. L. Li. 2016. “Multitasking via Alternate and Shared Processing: Algorithms and Complexity.” Discrete Applied Mathematics 208: 41–58.
  • Ji, M., W. Zhang, L. Liao, T. C. E. Cheng, and Y. Tan. 2019. “Multitasking Parallel-machine Scheduling with Machine-dependent Slack Due-window Assignment.” International Journal of Production Research 57 (6): 1667–1684.
  • Jiang, F., X. Zhang, D. Bai, and C. C. Wu. 2018. “Competitive Two-agent Scheduling Problems to Minimize the Weighted Combination of Makespans in a Two-machine Open Shop.” Engineering Optimization 50 (4): 684–697.
  • Kovalyov, M. Y., A. Oulamara, and A. Soukhal. 2015. “Two-agent Scheduling with Agent Specific Batches on an Unbounded Serial Batching Machine.” Journal of Scheduling 18 (4): 423–434.
  • 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.
  • Leung, J. Y. T., M. Pinedo, and G. Wan. 2010. “Competitive Two-agent Scheduling and its Applications.” Operations Research 58 (2): 458–469.
  • Li, S. S., T. C. E. Cheng, C. T. Ng, and J. J. Yuan. 2017. “Two-agent Scheduling on a Single Sequential and Compatible Batching Machine.” Naval Research Logistics 64 (8): 628–641.
  • Li, S. S., and J. J. Yuan. 2012. “Unbounded Parallel-batching Scheduling with Two Competitive Agents.” Journal of Scheduling 15 (5): 629–640.
  • Liao, W., X. Zhang, and M. Jiang. 2017. “Multi-objective Group Scheduling Optimization Integrated with Preventive Maintenance.” Engineering Optimization 49 (11): 1890–1904.
  • Liu, M., S. Wang, F. Zheng, and C. Chu. 2017. “Algorithms for the Joint Multitasking Scheduling and Common Due Date Assignment Problem.” International Journal of Production Research 55 (20): 6052–6066.
  • 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.
  • 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.
  • 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.
  • Spink, A., M. Park, B. J. Jansen, and J. Pedersen. 2006. “Multitasking during Web Search Sessions.” Information Processing and Management 42 (1): 264–275.
  • Sum, J., and K. Ho. 2015. “Analysis on the Effect of Multitasking.” In Proceedings of the 2015 IEEE International Conference on Systems, Man, and Cybernetics, 204–209. Piscataway, NJ: IEEE.
  • Wang, J. Q., G. Q. Fan, Y. Q. Zhang, C. W. Zhang, and J. Y. T. Leung. 2017. “Two-agent Scheduling on a Single Parallel-batching Machine with Equal Processing Time and Non-identical Job Sizes.” European Journal of Operational Research 258 (2): 478–490.
  • Wang, D. J., Y. Yin, S. R. Cheng, T. C. E. Cheng, and C. C. Wu. 2016. “Due Date Assignment and Scheduling on a Single Machine with Two Competing Agents.” International Journal of Production Research 54 (4): 1152–1169.
  • Wang, D. J., Y. Yin, J. Xu, W. H. Wu, S. R. Cheng, and C. C Wu. 2015. “Some Due Date Determination Scheduling Problems with Two Agents on a Single Machine.” International Journal of Production Economics 168: 81–90.
  • Yin, Y., Y. Chen, K. Qin, and D. Wang. 2019. “Two-agent Scheduling on Unrelated Parallel Machines with Total Completion Time and Weighted Number of Tardy Jobs Criteria.” Journal of Scheduling 22 (3): 315–333.
  • 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.
  • Yin, Y., S. R. Cheng, T. C. E. Cheng, C. C. Wu, and W. H. Wu. 2012. “Two-agent Single-machine Scheduling with Assignable Due Dates.” Applied Mathematics and Computation 219 (4): 1674–1685.
  • Yin, Y., T. C. E. Cheng, X. Yang, and C. C. Wu. 2015. “Two-agent Single Machine Scheduling with Unrestricted Due Date Assignment.” Computers & Industrial Engineering 79: 148–155.
  • Yin, Y., Y. Wang, T. C. E. Cheng, D. J. Wang, and C. C. Wu. 2016. “Two-agent Single-machine Scheduling to Minimize the Batch Delivery Cost.” Computers & Industrial Engineering 92: 16–30.
  • Yin, Y., D. Wang, C. C. Wu, and T. C. E. Cheng. 2016. “CON/SLK Due Date Assignment and Scheduling on a Single Machine with Two Agents.” Naval Research Logistics 63 (5): 416–429.
  • Yin, Y., Y. Yang, D. Wang, T. C. E. Cheng, and C. C. Wu. 2018. “Integrated Production, Inventory, and Batch Delivery Scheduling with Due Date Assignment and Two Competing Agents.” Naval Research Logistics 65 (5): 393–409.
  • Zhu, Z., F. Zheng, and C. Chu. 2017. “Multitasking Scheduling Problems with a Rate-modifying Activity.” International Journal of Production Research 55 (1): 296–312.
  • Zhu, Z., M. Liu, C. Chu, and L. Li. 2017. “Multitasking Scheduling with Multiple Rate-modifying Activities.” International Transactions in Operational Research 26 (5): 1956–1976.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.