Single machine group scheduling problem with makespan objective and a proportional linear shortening

Open Access

Issue		RAIRO-Oper. Res. Volume 56, Number 3, May-June 2022


Page(s)		1523 - 1532
DOI		https://doi.org/10.1051/ro/2022078
Published online		16 June 2022

B. Alidaee and N.K. Womer, Scheduling with time dependent processing times: Review and extensions. J. Oper. Res. Soc. 50 (1999) 711–720. [CrossRef] [Google Scholar]
A. Azzouz, M. Ennigrou and L.B. Said, Scheduling problems under learning effects: Classification and cartography. Int. J. Prod. Res. 56 (2018) 1642–1661. [CrossRef] [Google Scholar]
J. Bai, Z.R. Li and X. Huang, Single-machine group scheduling with general deterioration and learning effects. Appl. Math. Model. 36 (2012) 1267–1274. [CrossRef] [MathSciNet] [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]
T.C.E. Cheng, Q. Ding and B.M.T. Lin, A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152 (2004) 1–13. [CrossRef] [Google Scholar]
J.M. Framinan and R. Leisten, An efficient constructive heuristic for flowtime minimization in permutation flow shops. Omega 31 (2003) 311–317. [CrossRef] [Google Scholar]
S. Gawiejnowicz, Models and Algorithms of Time-Dependent Scheduling. Springer, Berlin (2020). [Google Scholar]
K.I.-J. Ho, J.Y.-T. Leung and W.-D. Wei, Complexity of scheduling tasks with time-dependent execution times. Inf. Process. Lett. 48 (1993) 315–320. [CrossRef] [Google Scholar]
X. Huang, N. Yin, W.-W. Liu and J.-B. Wang, Common due window assignment scheduling with proportional linear deterioration effects. Asia-Pac. J. Oper. Res. 37 (2020) 1950031. [CrossRef] [MathSciNet] [Google Scholar]
P. Ji and L. Li, Single-machine group scheduling problems with variable job processing times. Math. Prob. Eng. 2015 (2015) 758919 (9 pages). [Google Scholar]
T. Keshavarz, M. Savelsbergh and N. Salmasi, A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties. Appl. Math. Model. 39 (2015) 6410–6424. [CrossRef] [MathSciNet] [Google Scholar]
L. Li and J.-J. Wang, Scheduling jobs with deterioration effect and controllable processing time. Neural Comput. App. 29 (2018) 1163–1170. [CrossRef] [Google Scholar]
S.-S. Lin, A note on parallel-machine scheduling with controllable processing times and job-dependent learning effects. RAIRO-Oper. Res. 55 (2021) 561–569. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
F. Liu, J. Yang and Y.-Y. Lu, Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs. Eng. Optim. 51 (2019) 862–874. [CrossRef] [MathSciNet] [Google Scholar]
Y.-Y. Lu, J.-J. Wang and J.-B. Wang, Single machine group scheduling with decreasing time-dependent processing times subject to release dates. Appl. Math. Comput. 234 (2014) 286–292. [MathSciNet] [Google Scholar]
Y.-Y. Lu, J. Jin, P. Ji and J.-B. Wang, Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine. Neural Comput. App. 27 (2016) 1993–2000. [CrossRef] [Google Scholar]
Y.-Y. Lu, J.-B. Wang, P. Ji and H. He, A note on resource allocation scheduling with group technology and learning effects on a single machine. Eng. Optim. 49 (2017) 1621–1632. [CrossRef] [MathSciNet] [Google Scholar]
J.S. Neufeld, J.N.D. Gupta and U. Buscher, A comprehensive review of flowshop group scheduling literature. Comput. Oper. Res. 70 (2016) 56–74. [CrossRef] [MathSciNet] [Google Scholar]
C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J. Oper. Res. Soc. 43 (1992) 395–406. [CrossRef] [Google Scholar]
J.-B. Wang and L.-Y. Sun, Single-machine group scheduling with decreasing linear deterioration setup times and job processing times. Int. J. Adv. Manuf. Technol. 49 (2010) 765–772. [CrossRef] [Google Scholar]
J.-B. Wang and J.-J. Wang, Single machine group scheduling with time dependent processing times and ready times. Inf. Sci. 275 (2014) 226–231. [CrossRef] [Google Scholar]
J.-B. Wang and Z.-Q. Xia, Scheduling jobs under decreasing linear deterioration. Inf. Process. Lett. 94 (2005) 63–69. [CrossRef] [Google Scholar]
J.-B. Wang, A.-X. Guo, F. Shan, B. Jiang and L.-Y. Wang, Single machine group scheduling under decreasing linear deterioration. J. Appl. Math. Comput. 24 (2007) 283–293. [CrossRef] [MathSciNet] [Google Scholar]
J.-B. Wang, L. Lin and F. Shan, Single-machine group scheduling problems with deteriorating jobs. Int. J. Adv. Manuf. Technol. 39 (2008) 808–812. [CrossRef] [Google Scholar]
J.-B. Wang, X. Huang, Y.-B. Wu and P. Ji, Group scheduling with independent setup times, ready times, and deteriorating job processing times. Int. J. Adv. Manuf. Technol. 60 (2012) 643–649. [CrossRef] [Google Scholar]
D. Wang, Y. Huo and P. Ji, Single-machine group scheduling with deteriorating jobs and allotted resource. Optim. Lett. 8 (2014) 591–605. [CrossRef] [MathSciNet] [Google Scholar]
Z. Wang, C.-M. Wei and Y.-Y. Lu, Permutation flow shop problem with shortening job processing times. Asia-Pac. J. Oper. Res. 33 (2016) 1650032 (14 pages). [CrossRef] [MathSciNet] [Google Scholar]
J.-B. Wang, L. Liu, J.-J. Wang and L. Li, Makenspan minimization scheduling with ready times, group technology and shortening job processing times. Comput. J. 61 (2018) 1422–1428. [CrossRef] [MathSciNet] [Google Scholar]
L.-Y. Wang, X. Huang, W.-W. Liu, Y.-B. Wu and J.-B. Wang, Scheduling with position-dependent weights, due-date assignment and past-sequence-dependent setup times. RAIRO-Oper. Res. 55 (2021) S2747–S2758. [CrossRef] [EDP Sciences] [Google Scholar]
Y.-T. Xu, Y. Zhang and X. Huang, Single-machine ready times scheduling with group technology and proportional linear deterioration. Appl. Math. Model. 38 (2014) 384–391. [CrossRef] [MathSciNet] [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.