Single Machine Slack Due-Window Assignment and Scheduling of Linear Time-Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity

HTML  XML Download Download as PDF (Size: 492KB)  PP. 1-9  
DOI: 10.4236/oalib.1104907    482 Downloads   1,113 Views  Citations
Author(s)

ABSTRACT

In this paper, we consider the slack due-window assignment model and study a single machine scheduling problem of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. The objective is to find the job schedule having an assigned maintenance activity and due-windows with the minimum total cost consisting of costs of earliness, tardiness, window location and window size. A polynomial-time algorithm is presented in this paper with time complexity for n jobs.

Share and Cite:

Cheng, B. and Cheng, L. (2018) Single Machine Slack Due-Window Assignment and Scheduling of Linear Time-Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity. Open Access Library Journal, 5, 1-9. doi: 10.4236/oalib.1104907.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.