×
Zhu, Zhanguo; Liu, Ming; Chu, Chengbin; Li, Jinlin

Multitasking scheduling with multiple rate-modifying activities. (English) Zbl 07766380

Int. Trans. Oper. Res. 26, No. 5, 1956-1976 (2019).
Summary: This paper considers scheduling problems with human operators having the option to perform multiple rate-modifying activities (MRMAs) while they are carrying out multitasking. Thus, the processing of a selected task suffers jointly from interruptions by other available but unfinished tasks and MRMAs. Two types of objective functions are studied: single-criterion minimizing the total completion time, and multicriteria minimizing a weighted combination of the total completion time, the total absolute differences in completion times, and a weighted combination of the total waiting time and the total absolute differences in waiting times. We propose optimal solution algorithms for all the studied problems and also analyze some special cases of them.
{© 2017 The Authors. International Transactions in Operational Research © 2017 International Federation of Operational Research Societies}

Cited in 11 Documents

MSC:

90-XX Operations research, mathematical programming

Keywords:

scheduling; multitasking; multiple RMAs; algorithm
Cite Review PDF
Full Text: DOI

References:

[1] Bagchi, U., 1989. Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems. Operations Research37, 118-125. · Zbl 0661.90046
[2] Brucker, P., 2007. Scheduling Algorithms. Springer, Berlin. · Zbl 1126.90001
[3] Chen, K., Ji, M., Ge, J., Wei, G., 2014. Scheduling position‐based deteriorating jobs with multiple rate‐modifying activities and past‐sequence‐dependent delivery times. Asia Pacific Journal of Operational Research3, 1-15. · Zbl 1309.90024
[4] Coviello, D., Ichino, A., Persico, N., 2014. Time allocation and task juggling. American Economic Review104, 609-623.
[5] Diwas Singh, K.C., 2014. Does multitasking improve performance? Evidence from the emergency department. Manufacturing & Service Operations Management16, 168-183.
[6] Dobson, G., Tezcan, T., Tilson, V., 2013. Optimal workflow decisions for investigators in systems with interruptions. Management Science59, 1125-1141.
[7] Gordon, V., Tarasevich, A.A., 2009. A note: common due date assignment for a single machine scheduling with the rate‐modifying activity. Computers & Operations Research36, 325-328. · Zbl 1163.90488
[8] Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R., 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics5, 287-326. · Zbl 0411.90044
[9] Hall, N.G., Leung, J.‐Y.‐T., Li, C.L., 2015. The effects of multitasking on operations scheduling. Production and Operations Management24, 8, 1248-1265.
[10] Hall, N.G., Leung, J.‐Y.‐T., Li, C.L., 2016. Multitasking via alternate and shared processing: algorithms and complexity. Discrete Applied Mathematics208, 41-58. · Zbl 1343.90035
[11] Hardy, G.H., Littlewood, J.E., Polya, G., 1934. Inequalities. Cambridge University Press, London. · JFM 60.0169.01
[12] Ji, M., Cheng, T.C.E., 2010. Scheduling with job‐dependent learning effects and multiple rate‐modifying activities. Information Processing Letters110, 460-463. · Zbl 1229.90061
[13] Ji, M., Yao, D., Yang, Q., Cheng, T.C.E., 2014. Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity. International Transactions in Operational Research22, 997-1015. · Zbl 1330.90031
[14] Lee, C.‐L., Leon, V.‐J., 2001. Machine scheduling with a rate modifying activity. European Journal of Operational Research129, 119-128. · Zbl 0983.90020
[15] Lodree, E.J., Geiger, C.D., 2010. A note on the optimal sequence position for a rate‐modifying activity under simple linear deterioration. European Journal of Operational Research201, 644-648. · Zbl 1192.90076
[16] Ma, Y., Chu, C., Zuo, C., 2010. A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering58, 199-211.
[17] Mosheiov, G., Oron, D., 2006. Due‐date assignment and maintenance activity scheduling problem. Mathematical and Computer Modelling44, 1053-1057. · Zbl 1161.90397
[18] Ozturkoglu, Y., Bulfin, R.L., 2011. A unique integer mathematical model for scheduling deteriorating jobs with rate‐modifying activities on a single machine. International Journal of Advanced Manufacturing Technology57, 753-762.
[19] Ozturkoglu, Y., Bulfin, R.L., 2012. Scheduling jobs to consider physiological factors. Human Factors and Ergonomics in Manufacturing & Service Industries22, 113-120.
[20] Pashler, H., 1994. Dual‐task interference in simple tasks: data and theory. Psychological Bulletin116, 220-244.
[21] Radner, R., Rothschild, M., 1975. On the allocation of effort. Journal of Economic Theory10, 358-376. · Zbl 0331.90032
[22] Seshadri, S., Shapira, Z., 2001. Managerial allocation of time and effort: the effects of interruptions. Management Science47, 647-662.
[23] Sum, J., Ho, K., 2015. Analysis on the effect of multitasking. IEEE International Conference on Systems, Man, and Cybernetics (SMC), 204-209.
[24] Yang, S.‐J., Yang, D.‐L., Cheng, T.C.E., 2010. Single‐machine due‐window assignment and scheduling with job‐dependent aging effects and deteriorating maintenance. Computers & Operations Research37, 1510-1514. · Zbl 1183.90203
[25] Yin, Y., Liu, M., Hao, J., Zhou, M., 2012. Single machine scheduling with job‐position‐dependent learning and time‐dependent deterioration. IEEE Transactions on Systems, Man, and Cybernetics‐Part A: Systems and Humans42, 192-200.
[26] Zhao, C.L., Tang, H.Y., 2012. A note to due‐window assignment and single machine scheduling with deteriorating jobs and a rate‐modifying activity. Computers & Operations Research39, 1300-1303. · Zbl 1251.90209
[27] Zhu, Z., Zheng, F., Chu, C., 2017. Multitasking scheduling problems with a rate‐modifying activity. International Journal of Production Research55, 1, 296-312.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.