Open Access
RAIRO-Oper. Res.
Volume 55, Number 3, May-June 2021
Page(s) 1787 - 1798
Published online 22 June 2021
  • P. Brucker, Scheduling Algorithms. Springer, Berlin (2007). [Google Scholar]
  • E. Gerstl and G. Mosheiov, Due-window assignment with identical jobs on parallel uniform machines. Eur. J. Oper. Res. 229 (2013) 41–47. [Google Scholar]
  • N.G. Hall, J.Y.T. Leung and C.L. Li, The effects of multitasking on operations scheduling. Prod. Oper. Manag. 24 (2015) 1248–1265. [CrossRef] [Google Scholar]
  • N.G. Hall, J.Y.T. Leung and C.L. Li, Multitasking via alternate and shared processing: algorithms and complexity. Discret. Appl. Math. 208 (2016) 41–58. [CrossRef] [Google Scholar]
  • A. Janiak, W. Janiak, M.Y. Kovalyov, E. Kozan and E. Pesch, Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Inf. Sci. 224 (2013) 109–117. [CrossRef] [Google Scholar]
  • M. Ji, X. Zhang, X.Y. Tang, T.C.E. Cheng, G.Y. Wei and Y.Y. Tan, Group scheduling with group-dependent multiple due windows assignment. Int. J. Pro. Res. 54 (2016) 1244–1256. [CrossRef] [Google Scholar]
  • M. Ji, L.J. Liao, W.Y. Zhang, T.C.E. Cheng and Y.Y. Tan, Multitasking Scheduling with General Aging Effect. Multiple Rate-Modifying Activities and Past-sequence-dependent Delivery Times. Working Paper (2018). [Google Scholar]
  • S. Li, R. Chen and J. Tian, Multitasking Scheduling Problems with Two Competitive Agents. Eng. Optimiz. 52 (2019) 1940–1956. [CrossRef] [Google Scholar]
  • S.D. Liman, S.S. Panwalkar and S. Thongmee, Common due window size and location determination in a single machine scheduling problem. J. Oper. Res. Soc. 93 (1998) 68–74. [CrossRef] [Google Scholar]
  • L. Liu, J.J. Wang and X.Y. Wang, Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost. Int. J. Prod. Res. 54 (2016) 1–10. [CrossRef] [Google Scholar]
  • M. Liu, S.J. Wang, F.F. Zheng and C.B. Chu, Algorithms for the joint multitasking scheduling and common due date assignment problem. Int. J. Prod. Res. 55 (2017) 6052–6066. [CrossRef] [Google Scholar]
  • L. Liu, J.J. Wang, F. Liu and M. Liu, Single machine due window assignment and resource allocation scheduling problems with learning and general positional effects. J. Manuf. Syst. 43 (2017) 1–14. [CrossRef] [Google Scholar]
  • G. Mosheiov and D. Oron, Due-window assignment with unit processing-time jobs. Nav. Res. Logist. 51 (2004) 1005–1017. [CrossRef] [Google Scholar]
  • C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ, Prentice Hall (1982). [Google Scholar]
  • A. Spink, Multitasking information behavior and information task switching: an exploratory study. J. Doc. 60 (2004) 336–345. [CrossRef] [Google Scholar]
  • A. Spink, H.C. Ozmutlu and S. Ozmutlu, Multitasking information seeking and searching processes. J. Am. Soc. Inform. Sci. Tech. 53 (2014) 639–652. [CrossRef] [Google Scholar]
  • D. Wang, Y. Yu, Y. Yin and T.C.E. Cheng, Multi-agent scheduling problems under multitasking. Int. J. Prod. Res. 59 (2020) 1–31. [CrossRef] [Google Scholar]
  • Y. Wang, J. Wang and Y. Yin, Due date assignment and multitasking scheduling with deterioration effect and efficiency promotion. Comput. Ind. Eng. 146 (2020) 106569. [CrossRef] [Google Scholar]
  • X. Xiong, P. Zhou, Y. Yin, T.C.E. Cheng and D. Li, An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines. Nav. Res. Logist. 66 (2019) 502–516. [CrossRef] [Google Scholar]
  • D.L. Yang, C.J. Lai and S.J. Yang, Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. Int. J. Prod. Econ. 150 (2014) 96–103. [CrossRef] [Google Scholar]
  • Y. Yang, G. Yin, C. Wang and Y. Yin, Due date assignment and two-agent scheduling under multitasking environment. J. Comb. Optim. 2 (2020). [Google Scholar]
  • Y. Yin, T.C.E. Cheng, C.J. Hsu and C.C. Wu, single-machine batch delivery scheduling with an assignable common due window. Omega 41 (2013) 216–225. [CrossRef] [Google Scholar]
  • Y. Yin, T.C.E. Cheng and S.R. Cheng, C.C. Wu, Single-machine batch delivery scheduling with an assignable common due date and controllable processing times. Comp. Ind. Eng. 65 (2013) 652–662. [CrossRef] [Google Scholar]
  • Z. Zhu, F. Zheng, C. Chu, Multitasking scheduling problems with a rate-modifying activity. Int. J. Prod. Res. (2016) 1–17. [Google Scholar]
  • Z.G. Zhu, M. Liu, C.B. Chu and J.L. Li, Multitasking scheduling with multiple rate-modifying activities. Int. Trans. Oper. Res. (2017) 1–21. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.