Free Access
Issue
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
Page(s) S2747 - S2758
DOI https://doi.org/10.1051/ro/2020117
Published online 02 March 2021
  • A. Allahverdi, The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246 (2015) 345–378. [Google Scholar]
  • A. Allahverdi, C.T. Ng, T.C.E. Cheng and M.Y. Kovalyov, A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187 (2008) 985–1032. [Google Scholar]
  • D. Biskup, A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188 (2008) 315–329. [Google Scholar]
  • D. Biskup and J. Herrmann, Single-machine scheduling against due dates with past-sequence-dependent setup times. Eur. J. Oper. Res. 191 (2008) 587–592. [Google Scholar]
  • P. Brucker, Scheduling Algorithms, 3rd edition. Springer, Berlin-Heidelberg (2001). [Google Scholar]
  • T.C.E. Cheng, W.-C. Lee and C.-C. Wu, Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Comput. Ind. Eng. 58 (2010) 326–331. [Google Scholar]
  • T.C.E. Cheng, W.-C. Lee and C.-C. Wu, Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times. Appl. Math. Model. 35 (2011) 1861–1867. [Google Scholar]
  • P. Chrétienne, Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine. RAIRO:OR 35 (2001) 165–187. [Google Scholar]
  • S. Gawiejnowicz, Time-Dependent Scheduling. Springer, Berlin-Heidelberg (2008). [Google Scholar]
  • V.S. Gordon, J.M. Proth and C.B. 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. [Google Scholar]
  • V.S. Gordon, J.M. Proth and C.B. Chu, Due date assignment and scheduling: SLK, TWK and other due date assignment models. Prod. Plan. Control 13 (2002) 117–132. [Google Scholar]
  • R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Disc. Math. 5 (1979) 287–326. [Google Scholar]
  • G.H. Hardy, J.E. Littlewood and G. Pólya, Inequalities, 2nd edition. Cambridge University Press, Cambridge, UK (1967). [Google Scholar]
  • C.-J. Hsu, W.-H. Kuo and D.-L. Yang, Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects. Appl. Math. Model. 35 (2011) 1492–1496. [Google Scholar]
  • X. Huang, G. Li, Y. Huo and P. Ji, Single machine scheduling with general time-dependent deterioration, position-dependent learning and past sequence-dependent setup times. Optim. Lett. 7 (2013) 1793–1804. [Google Scholar]
  • C. Koulamas and G.J. Kyparisis, Single-machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187 (2008) 1045–1049. [Google Scholar]
  • C. Koulamas and G.J. Kyparisis, New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives. Eur. J. Oper. Res. 278 (2019) 149–159. [Google Scholar]
  • W.-H. Kuo and D.-L. Yang, Single-machine scheduling with past-sequence-dependent setup times and learning effects. Inf. Process. Lett. 102 (2007) 22–26. [Google Scholar]
  • W.-H. Kuo, C.-J. Hsu and D.-L. Yang, Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects. Comput. Ind. Eng. 61 (2011) 179–183. [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. 49 (1998) 1007–1010. [Google Scholar]
  • H. Lin, C. He and Y. Lin, Bicriteria scheduling for due date assignment with total weighted tardiness. RAIRO:OR 52 (2018) 359–370. [Google Scholar]
  • W. Liu, X. Hu and X.-Y. Wang, Single machine scheduling with slack due dates assignment. Eng. Optim. 49 (2017) 709–717. [Google Scholar]
  • Y.-Y. Lu, G. Li, Y.-B. Wu and P. Ji, Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim. Lett. 8 (2014) 113–127. [Google Scholar]
  • Y.-Y. Lu, F. Teng and Z.-X. Feng, Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects. Asia Pac. J. Oper. Res. 32 (2015) 1550026. [Google Scholar]
  • V. Mani, P.-C. Chang and S.-H. Chen, Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis. Int. J. Syst. Sci. 42 (2011) 2097–2102. [Google Scholar]
  • H.M. Soroush, Scheduling in bicriteria single machine systems with past-sequence-dependent setup times and learning effects. J. Oper. Res. Soc. 65 (2014) 1017–1036. [Google Scholar]
  • L. Tai, Optimizing batch-processing operations with batch-position-based learning effects. To appear in: RAIRO:OR. DOI: 10.1051/ro/2019108 (2021). [Google Scholar]
  • J.-B. Wang, Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect. Comput. Ind. Eng. 55 (2008) 584–591. [Google Scholar]
  • J.-B. Wang and J.-X. Li, Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects. Appl. Math. Model. 35 (2011) 1388–1395. [Google Scholar]
  • J.-J. Wang and Y.-J. Liu, Single-machine bicriterion group scheduling with deteriorating setup times and job processing times. Appl. Math. Comput. 242 (2014) 309–314. [Google Scholar]
  • X.-R. Wang and J.-B. Wang, Scheduling with past-sequence-dependent setup times and learning effects on a single machine. Int. J. Adv. Manuf. Technol. 48 (2010) 739–746. [Google Scholar]
  • X.-Y. Wang and J.-J. Wang, Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning. Appl. Math. Model. 37 (2013) 4905–4914. [Google Scholar]
  • J.-B. Wang, D. Wang, L.-Y. Wang, L. Lin, N. Yin and W.-W. Wang, Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times. Comput. Math. App. 57 (2009) 9–16. [Google Scholar]
  • X.-R. Wang, J. Jin, J.-B. Wang and P. Ji, Single machine scheduling with truncated job-dependent learning effect. Optim. Lett. 8 (2014) 669–677. [Google Scholar]
  • J.-B. Wang, X.-N. Geng, L. Liu, J.-J. Wang and Y.-Y. Lu, Single machine CON/SLK due date assignment scheduling with controllable processing time and job-dependent learning effects. Comput. J. 61 (2018) 1329–1337. [Google Scholar]
  • J.-B. Wang, F. Liu and J.-J. Wang, Research on m-machine flow shop scheduling with truncated learning effects. Int. Trans. Oper. Res. 26 (2019) 1135–1151. [Google Scholar]
  • J.-B. Wang, M. Gao, J.-J. Wang, L. Liu and H. He, Scheduling with a position-weighted learning effect and job release dates. Eng. Optim. 52 (2020) 1475–1493. [Google Scholar]
  • X. Xiong, D. Wang, T.C.E. Cheng, C. Wu and Y. Yin, Single-machine scheduling and common due date assignment with potential machine disruption. Int. J. Prod. Res. 56 (2018) 1345–1360. [Google Scholar]
  • X. Zhang and Y. Wang, Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed time based learning effect. Appl. Math. Comput. 250 (2015) 628–635. [Google Scholar]
  • X. Zhang, W. Lin, W. Wu and C. Wu, Single-machine common/slack due window assignment problems with linear decreasing processing times. Eng. Optim. 49 (2017) 1388–1400. [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.