Open Access
Issue
RAIRO-Oper. Res.
Volume 57, Number 2, March-April 2023
Page(s) 715 - 730
DOI https://doi.org/10.1051/ro/2023020
Published online 28 April 2023
  • K. Chen, M. Ji and J.J. Ge, A note on scheduling a maintenance activity and due-window assignment based on common flow allowance. Int. J. Prod. Econ. 145 (2013) 645–646. [CrossRef] [Google Scholar]
  • E. Gerstl, B. Mor and G. Mosheiov, Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times due-window and job rejection. Comput. Oper. Res. 83 (2017) 150–156. [CrossRef] [MathSciNet] [Google Scholar]
  • V.S. Gordon and V.A. Strusevich, Single machine scheduling and due date assignment with positionally dependent processing times. Eur. J. Oper. Res. 198 (2009) 57–62. [CrossRef] [Google Scholar]
  • V.S. Gordon, J.M. Proth and C. Chu, A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139 (2002) 1–25. [CrossRef] [Google Scholar]
  • V.S. Gordon, V. Strusevich and A. Dolgui, Scheduling with due date assignment under special conditions on job processing. J. Schedul. 15 (2012) 447–456. [CrossRef] [Google Scholar]
  • M. Iranpoor, S.M.T. Fatemi Ghomi and M. Zandieh, Order acceptance and due-date quotation in low machine rates. Appl. Math. Modell. 38 (2014) 2063–2072. [CrossRef] [Google Scholar]
  • A. Janiak, M.Y. Kovalyov and M. Marek, Soft due window assignment and scheduling on parallel machines. IEEE Trans. Syst. Man Cybern. 37 (2007) 614–620. [CrossRef] [Google Scholar]
  • A. Janiak, W.A. Janiak, T. Krysiak and T. Kwiatkowski, A survey on scheduling problems with due windows. Eur. J. Oper. Res. 242 (2015) 347–357. [CrossRef] [Google Scholar]
  • M. Ji, K. Chen, J. Ge and T.C.E. Cheng, Group scheduling and job-dependent due window assignment based on a common flow allowance. Comput. Ind. Eng. 68 (2014) 35–41. [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. Prod. Res. 54 (2016) 1244–1256. [CrossRef] [Google Scholar]
  • F.J. Kramer and C.Y. Lee, Common due window scheduling. Prod. Oper. Manage. 2 (1993) 262–275. [Google Scholar]
  • W.X. Li and C.L. Zhao, Single machine scheduling problem with multiple due windows assignment in a group technology. J. Appl. Math. Comput. 48 (2015) 477–494. [CrossRef] [MathSciNet] [Google Scholar]
  • S.S. Li, C.T. Ng and J.J. Yuan, Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine. Int. J. Prod. Econ. 131 (2011) 747–751. [CrossRef] [Google Scholar]
  • G. Li, M.L. Luo, W.J. Zhang and X.Y. Wang, Single-machine due-window assignment scheduling based on common flow allowance learning effect and resource allocation. Int. J. Prod. Res. 53 (2015) 1228–1241. [CrossRef] [MathSciNet] [Google Scholar]
  • B. Mor and G. Mosheiov, Scheduling a maintenance activity and due-window assignment based on common flow allowance. Int. J. Prod. Econ. 135 (2012) 222–230. [CrossRef] [Google Scholar]
  • B. Mor and G. Mosheiov, Minsum and Minmax scheduling on a proportionate flowshop with common flow-allowance. Eur. J. Oper. Res. 254 (2016) 360–370. [CrossRef] [Google Scholar]
  • G. Mosheiov and D. Oron, Job dependent due-window assignment based on a common flow allowance. Found. Comput. Decis. Sci. 35 (2010) 185–195. [Google Scholar]
  • H.W. Nian and Z.Z. Mao, Single-machine scheduling with job rejection deteriorating effects and deteriorating maintenance activities. Math. Prob. Eng. 389120 (2013) 1–9. [Google Scholar]
  • D. Shabtay, N. Gaspar and M. Kasp, A survey on offline scheduling with rejection. J. Schedul. 16 (2013) 3–28. [CrossRef] [Google Scholar]
  • S.A. Slotnick, Order acceptance and scheduling: a taxonomy and review. Eur. J. Oper. Res. 212 (2011) 1–11. [CrossRef] [Google Scholar]
  • X.S. Wang and V.A. Truong, Multi-priority online scheduling with cancellations. Oper. Res. 66 (2018) 104–122. [CrossRef] [MathSciNet] [Google Scholar]
  • J.B. Wang, L. Liu and C. Wang, Single machine SLK/ DIF due window assignment problem with learning effect and deteriorating jobs. Appl. Math. Modell. 37 (2013) 8394–8400. [CrossRef] [Google Scholar]
  • S.J. Yang and D.L. Yang, Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times. J. Oper. Res. Soc. 63 (2012) 1508–1515. [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]
  • S.W. Yang, L. Wan and N. Yin, Research on single machine SLK/ DIF due window assignment problem with learning effect and deteriorating jobs. Appl. Math. Modell. 39 (2015) 4593–4598. [CrossRef] [Google Scholar]
  • Y. Yin, M. Liu, T.C.E. Cheng, C.C. Wu and S.R. Cheng, Four single-machine scheduling problems involving due date determination decisions. Inf. Sci. 251 (2013) 164–181. [CrossRef] [Google Scholar]
  • Y. Yin, T.C.E. Cheng, C.C. Wu and S.R. Cheng, Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. J. Oper. Res. Soc. 65 (2014) 1–13. [CrossRef] [Google Scholar]
  • Y.Q. Yin, W.H. Wu, T.C.E. Cheng and C.C. Wu, Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities. Int. J. Prod. Res. 52 (2014) 2311–2326. [CrossRef] [Google Scholar]
  • Q. Yue and G.H. Wan, Single machine SLK/ DIF due window assignment problem with job-dependent linear deterioration effects. J. Oper. Res. Soc. 67 (2016) 872–883. [CrossRef] [Google Scholar]
  • C.L. Zhao and H.Y. Tang, Due-window assignment for a single machine scheduling with both deterioration and positional effects. Asia-Pac. J. Oper. Res. 32 (2015) 1550014. [CrossRef] [MathSciNet] [Google Scholar]
  • C.L. Zhao, Y.Q. Yin, T.C.E. Cheng and C.C. Wu, Single-machine scheduling and due date assignment with rejection and position-dependent processing times. J. Ind. Manage. Optim. 10 (2014) 691–700. [CrossRef] [Google Scholar]
  • X. Zhong and J. Ou, Parallel machine scheduling with restricted job rejection. Theor. Comput. Sci. 690 (2017) 1–11. [CrossRef] [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.