Abstract
This paper addresses a two-agent scheduling problem with due date assignment under multitasking environment, in which the due dates of the jobs from the first agent are decision variables to be determined using the unrestricted (usually referred to as DIF) due date assignment method. Each agent requests the processing of its own set of jobs on a machine and wishes to minimize a certain scheduling criterion related to the completion times of its jobs only. Under multitasking, when a job (primary job) is processed, it is inevitably interrupted by other jobs (waiting jobs) that are available but unfinished, and the amount of time that each waiting job interrupting the primary job is a linear function of the remaining processing time of the waiting job. The overall objective is to determine the optimal primary job sequence along with the due dates of the jobs from the first agent as to minimize the weighted sum of the due date assignment cost and weighted number of late jobs from the first agent, while maintaining the total completion time of the jobs from the second agent not exceeding a given threshold. We show that the problem is \(\mathcal {NP}\)-hard, devise a pseudo-polynomial time dynamic programming algorithm, establishing that it is \(\mathcal {NP}\)-hard in the ordinary sense, and demonstrate that it admits a fully polynomial-time approximation scheme.
Similar content being viewed by others
References
Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici (2004) A Scheduling problems with two competing agents. Oper Res 52:229–242
Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6:7–16
Cheng TCE, Wu WH, Cheng SR, Wu CC (2011) Two-agent scheduling with positionbased deteriorating jobs and learning effects. Appl Math Comput 217:8804–8824
Coviello D, Ichino A, Persico N (2014) Time allocation and task juggling. Am Econ Rev 104(2):609–623
Gerstl E, Mosheiov G (2014) Single machine just-in-time scheduling problems with two competing agents. Naval Res Logist 61:1–16
Hall NG, Leung YT, Li CL (2015) The effects of multitasking on operations scheduling. Prod Oper Manag 24(8):1248–1265
Hall NG, Leung YT, Li CL (2016) Multitasking via alternate and shared processing: algorithms and complexity. Discrete Appl Math 208:41–58
Jez V (2011) Searching for the meaning of multitasking. Norsk Konferanse for Organisasjoners Bruk av Informasjonsteknologi, 157–166
Ji M, Zhang WY, Liao LJ, Cheng TCE, Tan YY (2019) Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment. Int J Prod Res 57(6):1667–1684
Leung JYT, Pinedo M, Wan GH (2010) Competitive two agents scheduling and its applications. Oper Res 58(2):458–469
Li S, Chen RX, Tian J (2019) Multitasking scheduling problems with two competitive agents. Eng Optim. https://doi.org/10.1080/0305215X.2019.1678609
Liu M, Wang S, Zhang F, Chu C (2017) Algorithms for the joint multitasking scheduling and common due date assignment problem. Int J Prod Res 55(20):1–15
Loukopoulos LD, Dismukes RK, Barshi I (2009) The multitasking myth: handling complexity in real-world operations. J Adult Edu 41(7):1046–1047
Mayer RE, Moreno R (2003) Nine ways to reduce cognitive load in multimedia learning. Edu Psychol 38(1):43–52
Monsell S (2003) Task Switching. Trends Cognitive Sci 7(3):134–140
Mor B, Mosheiov G (2014) A two-agent single machine scheduling problem with due-window assignment and a common ow-allowance. J Comb Optim 33:1454–1468
Ophir E, Nass C, Wagner AD (2009) Cognitive control in media multitaskers. Proc National Acad SciUnited States Am 106(37):15583–15587
Perez-Gonzalez P, Framinan JM (2014) A common framework and taxonomy for multicriteria scheduling problem with interfering and competing jobs: multi-agent scheduling problems. Eur J Oper Res 235:1–16
Rosen C (2008) AThemyth ofmultitasking. New Atlantis 20:105–110
Seshadri S, Shapira Z (2001) Managerial allocation of time and effort: the effects of interruptions. Manag Sci 47:647–662
Spink A, Ozmutlu HC, Ozmutlu S (2002) Multitasking information seeking and searching processes. J Am Soc Inf Sci Technol 53(8):639–652
Trafton JG, Altmann EM, Brock DP, Mintz FE (2003) Preparing to resume an interrupted task: effects of prospective goal encoding and retrospective rehearsal. Int J Human Comput Stud 58:583–603
Wan G, Vakati RS, Leung JYT, Pinedo M (2010) Scheduling two agents with controllable processing times. Eur J Oper Res 205:528–539
Wang D, Yin Y, Xu J, Wu WH, Cheng XR, Wu CC (2015) Some due date determination scheduling problems with two agents on a single machine. Int J Prod Econ 168:81–90
Wang D, Yu Y, Yin Y, Cheng TCE (2019) Multi-agent scheduling problems under multitasking. Int J Prod Res, submited
Watson JM, Strayer DL (2010) Supertaskers: profiles in extraordinary multitasking ability. Psychon Bull Rev 17(4):479–485
Woeginger GJ (2000) When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J Comput 12:57–75
Xiong X, Zhou P, Yin Y, Cheng TCE, Li D (2019) An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines. Naval Res Logist, 1–15
Yang Y, Yin Y, Shi Q (2019) Two competing agents with due date assignment scheduling under multitasking environment. In: 2019 International conference on industrial engineering and systems management (IESM), https://doi.org/10.1109/IESM45758.2019.8948203
Yin Y, Cheng TCE, Yang X, Wu CC (2015) Two-agent single-machine scheduling with unrestricted due date assignment. Comput Ind Eng 79:148–155
Yin Y, Wang D, Wu CC, Cheng TCE (2016a) CON/SLK due date assignment and scheduling on a single machine with two agents. Naval Res Logist 63:416–429
Yin Y, Wang Y, Cheng TCE, Wang D, Wu CC (2016b) Two-agent single-machine scheduling to minimize the batch delivery cost. Comput Ind Eng 92:16–30
Yin Y, Li D, Wang D, Cheng TCE (2018a) Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann Oper Res. https://doi.org/10.1007/s10479-018-2839-6
Yin Y, Yang Y, Wang D, Cheng TCE, Wu CC (2018b) Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Naval Res Logist 65:393–409
Zhu Z, Liu M, Chu CB, Li J (2019) Multitasking scheduling with multiple rate-modifying activities. Int Trans Oper Res 26:1956–1976
Zhu Z, Zheng F, Chu CB (2018) Multitasking scheduling problems with a rate-modifying activity. Int J Prod Res 55(1):296–312
Acknowledgements
We thank the review team for their helpful comments on an earlier version of our paper. This paper was supported in part by the National Natural Science Foundation of China under Grant Number 71971041 and by the Outstanding Young Scientific and Technological Talents Foundation of Sichuan Province under grant number 20JCQN0281.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Yang, Y., Yin, G., Wang, C. et al. Due date assignment and two-agent scheduling under multitasking environment. J Comb Optim 44, 2207–2223 (2022). https://doi.org/10.1007/s10878-020-00600-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00600-5