Abstract

In this paper, we consider the slack due-window method and investigate single machine scheduling with a deteriorating rate-modifying activity, linear resource allocation and aging effect. The objective is to minimize the total cost caused by the due-window location, the due-window size, the earliness and tardiness with respect to a slack due-window, and resource consumption. We provide a polynomial-time algorithm to solve the corresponding problem.

Citation details of the article

Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 30
Issue: 5
Year: 2017

DOI: 10.12732/ijam.v30i5.2

Download Section

Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.

References

2. [1] T. C. E. Cheng, Optimal common due-date with limited completion time deviation, Computers & Operations Research, 15 (1988), 91-96.
3. [2] S. Liman, S. Panwalkar, and S. Thongmee, Common due window size and location determination in a single machine scheduling problem, Journal of the Operational Research Society, 49 (1998), 1007-1010.
4. [3] J.-B. Wang and C. Wang, Single-machine due-window assignment problem with learning effect and deteriorating jobs, Applied Mathematical Modelling, 35 (2011), 4017-4022.
5. [4] J.-B. Wang, L. Liu, and C. Wang, Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs, Applied Mathematical Modelling, 37 (2013), 8394-8400.
6. [5] S.-J. Yang, D.-L. Yang, and T. C. E. Cheng, Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance, Computers & Operations Research, 37 (2010), 1510-1514.
7. [6] C.-L. Zhao and H.-Y. Tang, Single machine scheduling with general jobdependent aging effect and maintenance activities to minimize makespan, Applied Mathematical Modelling, 34 (2010), 837-841.
8. [7] R. Rudek, Scheduling problems with position dependent job processing times: computational complexity results, Annals of Operations Research, 196 (2012), 491-516.
9. [8] R. Vickson, Two single machine sequencing problems involving controllable job processing times, AIIE Transactions, 12 (1980), 258-262.
10. [9] M. Ji, J. Ge, K. Chen, and T. Cheng, Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity, Computers & Industrial Engineering, 66 (2013), 952-961.
11. [10] B. Cheng and L. Cheng, Note on single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity, Computers & Industrial Engineering, 78 (2014), 320-322.
12. [11] C.-Y. Lee and V. Leon, Machine scheduling with a rate-modifying activity, European Journal of Operational Research, 128 (2001), 119-128.
13. [12] T. C. E. Cheng, S.-J. Yang, and D.-L. Yang, Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity, International Journal of Production Economics, 135 (2012), 154-161.
14. [13] B. Mor and G. Mosheiov, Scheduling a maintenance activity and duewindow assignment based on common flow allowance, International Journal of Production Economics, 135 (2012), 222-230.
15. [14] G. Mosheiov and D. Oron, Job-dependent due-window assignment based on a common flow allowance, Foundations of Computing and Decision Sciences, 35 (2010), 185-195.
16. [15] K. Chen, M. Ji, and J. Ge, A note on scheduling a maintenance activity and due-window assignment based on common flow allowance, International Journal of Production Economics, 145 (2013), 645-646.