In this paper, single-machine scheduling problems with proportional linear deterioration effects and common due window assignment simultaneously are considered. Two different objective functions are studied, the first is to minimize the sum of the number of early jobs, number of tardy jobs and due window location and due window size, the second is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Optimality properties for all problems are provided and polynomial time algorithms for solving these problems are given.

Keywords:

References

Browne, S and U Yechiali (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38(3), 495–498. Crossref, Web of Science, Google Scholar
Cheng, TCE, S Yang and D-L Yang (2012). Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. International Journal of Production Economics, 135(1), 154–161. Crossref, Web of Science, Google Scholar
Gawiejnowicz, S (2008). Time-Dependent Scheduling. Springer, Berlin, ISBN 978-3-540-69445-8. Crossref, Google Scholar
Gupta, JND and SK Gupta (1988). Single facility scheduling with nonlinear processing times. Computers & Industrial Engineering, 14(4), 387–393. Crossref, Web of Science, Google Scholar
Janiak, A, WA Janiak, T Krysiak and T Kwiatkowski (2015). A survey on scheduling problems with due windows. European Journal of Operational Research, 242(2), 347–357. Crossref, Web of Science, Google Scholar
Janiak, A, T Kwiatkowski and M Lichtenstein (2013). Scheduling problems with a common due window assignment: A survey. International Journal of Applied Mathematics and Computer Science, 23(1), 231–241. Crossref, Web of Science, Google Scholar
Kramer, FJ and CY Lee (1993). Common due window scheduling. Production and Operational Management, 2(4), 262–275. Crossref, Google Scholar
Kononov, A (1998). A single machine scheduling problems with processing times proportional to an arbitrary function. Discrete Analysis and Operations Research, 5(3), 17–37 (in Russian). Google Scholar
Liu, X, S Lu, J Pei and PM Pardalos (2018). A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs. International Journal of Production Research, 56(17), 5758–5775. Crossref, Web of Science, Google Scholar
Liu, L, J-J Wang and X-Y Wang (2016). Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost. International Journal of Production Research, 54(4), 1186–1195. Crossref, Web of Science, Google Scholar
Liu, J, Y Wang and X Min (2013). Single-machine scheduling with common due-window assignment for deteriorating jobs. Journal of the Operational Research Society, 64(12), 1–11. Google Scholar
Liu, F, J Yang and Y-Y Lu (2019). Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs. Engineering Optimization, 51(5), 862–874. Crossref, Web of Science, Google Scholar
Mosheiov, G (1994). Scheduling jobs under simple linear deterioration. Computers & Operations Research, 21(6), 653–659. Crossref, Web of Science, Google Scholar
Pei, J, X Liu, W Fan, PM Pardalos and S Lu (2019). A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega, 82, 55–69. Crossref, Web of Science, Google Scholar
Pei, J, X Liu, PM Pardalos, A Migdalas and S Yang (2017a). Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. Journal of Global Optimization, 67, 251–262. Crossref, Web of Science, Google Scholar
Pei, J, X Liu, PM Pardalos, W Fan and S Yang (2017b). Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Annals of Operations Research, 249(1–2), 175–195. Crossref, Web of Science, Google Scholar
Pei, J, PM Pardalos, X Liu, W Fan and S Yang (2015). Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. European Journal of Operations Research, 244(1), 13–25. Crossref, Web of Science, Google Scholar
Shi, H-B and J-B Wang (2019). Research on common due window assignment flow shop scheduling with learning effect and resource allocation. Engineering Optimization, https://doi.org/10.1080/0305215X.2019.1604698. Crossref, Web of Science, Google Scholar
Sun, L-H, C-C Ge, W Zhang, J-B Wang and Y-Y Lu (2018). Permutation flow shop scheduling with simple linear deterioration. Engineering Optimization, https://doi.org/10.1080/0305215X.2018.1519558. Web of Science, Google Scholar
Wang, J-B and L Li (2018). Machine scheduling with deteriorating jobs and modifying maintenance activities. The Computer Journal, 61(1), 47–53. Crossref, Web of Science, Google Scholar
Wang, J-B and X-X Liang (2019). Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Engineering Optimization, 51(2), 231–246. Crossref, Web of Science, Google Scholar
Wang, J-B, M Liu, N Yin and P Ji (2017). Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. Journal of Industrial and Management Optimization, 13(2), 1025–1039. Crossref, Web of Science, Google Scholar
Wang, J-B and C Wang (2011). Single-machine due-window assignment problem with learning effect and deteriorating jobs. Applied Mathematical Modeling, 35(8), 4017–4022. Crossref, Web of Science, Google Scholar
Wang, J-B and M-Z Wang (2013). Minimizing makespan in three-machine flow shops with deteriorating jobs. Computers & Operations Research, 40(2), 547–557. Crossref, Web of Science, Google Scholar
Wang, J-B and M-Z Wang (2014a). Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia-Pacific Journal of Operational Research, 31(5), 1450036. Link, Web of Science, Google Scholar
Wang, J-B and J-J Wang (2014b). Single machine group scheduling with time dependent processing times and ready times. Information Sciences, 275, 226–231. Crossref, Web of Science, Google Scholar
Wang, Z, C Wei and Y-B Wu (2016). Single machine two-agent scheduling with deteriorating jobs. Asia-Pacific Journal of Operational Research, 33(5), 1650034. Link, Web of Science, Google Scholar
Wang, J-B, B Zhang, L Li, D Bai and Y-B Feng (2019). Due-window assignment scheduling problems with position-dependent weights on a single machine. Engineering Optimization, https://doi.org/10.1080/0305215X.2019.1577411. Web of Science, Google Scholar
Wu, Y-B, L Wan and X-Y Wang (2015). Study on due-window assignment scheduling based on common flow allowance. International Journal of Production Economics, 165, 155–157. Crossref, Web of Science, Google Scholar
Yin, Y, TCE Cheng, L Wan, C-C Wu and J Liu (2015a). Two-agent single-machine scheduling with deteriorating jobs, Computers & Industrial Engineering, 81, 177–185. Crossref, Web of Science, Google Scholar
Yin, N and L Kang (2015). Minimizing makespan in permutation flow shop scheduling with proportional deterioration. Asia-Pacific Journal of Operational Research, 32(6), 1550050. Link, Web of Science, Google Scholar
Yin, Y, W-H Wu, TCE Cheng and C-C Wu (2015b). Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. International Journal of Computer Integrated Manufacturing, 28(7), 781–790. Crossref, Web of Science, Google Scholar
Yue, Q and GH Wan (2016). Single machine SLK/DIF due window assignment problem with job-dependent linear deterioration effects. Journal of the Operational Research Society, 67(6), 872–883. Crossref, Web of Science, Google Scholar
Zhao, C-L and H-R Tang (2012). A note to due window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity. Computers & Operations Research, 39(6), 1300–1303. Crossref, Web of Science, Google Scholar