SINGLE MACHINE SLACK DUE-WINDOW SCHEDULING
WITH LINEAR RESOURCE ALLOCATION AND
POSITION-DEPENDENT PROCESSING TIMES
Bo Cheng1, Ling Cheng2
1Department of Applied Mathematics
School of Finance
Guangdong University of Foreign Studies
Guangzhou, 510420, CHINA
2School of Electrical and Information Engineering
University of the Witwatersrand
Private Bag 3, Wits. 2050, Johannesburg, SOUTH AFRICA

Abstract

In this paper, we investigate single machine scheduling with linear resource allocation and position-dependent processing times based on the slack due-window method. The objective is to minimize the total cost caused by the due-window location, the due-window size, the resource consumption, the makespan and the earliness and tardiness with respect to a slack due-window. We provide a polynomial-time algorithm to solve the 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: 31
Issue: 5
Year: 2018

DOI: 10.12732/ijam.v31i5.9

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

  1. [1] 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, Journal of the Operational Research Society, 65, No 1 (2014), 1-13.
  2. [2] R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5 (1979), 287-326.
  3. [3] 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.
  4. [4] B. Mor and G. Mosheiov, Scheduling a maintenance activity and duewindow assignment based on common flow allowance, International Journal of Production Economics, 135, No 1 (2012), 222-230.
  5. [5] 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, No 2 (2013), 645-646.
  6. [6] B. Cheng and L. Cheng, Single machine slack due-window scheduling with linear resource allocation, aging effect, and a deteriorating rate-modifying activity, International Journal of Applied Mathematics, 30, No 5 (2017), 375-386; DOI: 10.12732/ijam.v30i5.2.
  7. [7] 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, No 4 (2013), 952-961.
  8. [8] E. Prasetyaningsih, T. Samadhi, and A. Halim, Production and delivery batch scheduling with a common due date and multiple vehicles to minimize total cost, IOP Conference Series: Materials Science and Engineering , 114, No 1 (2016), 1-10.
  9. [9] E. Prasetyaningsih, Suprayogi, T. M. A. A. Samadhi, and A. H. Halim, Production and delivery batch scheduling with multiple due dates to minimize total cost, Journal of Engineering and Technological Science, 49, No 1 (2017), 16-36.
  10. [10] N. P. A. Hidayat, A. Cakravastia, T. M. A. A. Samadhi, and A. H. Halim, A batch scheduling for m heterogeneous batch processor, International Journal of Production Research, 54, No 4 (2016), 1170-1185.