Abstract
In this paper, we study single-machine scheduling that considers slack (SLK) due-window assignment, past-sequence-dependent delivery times and controllable job processing times simultaneously. We assume that the actual processing time of a job is a function of the learning effect on the job and resource allocation to the job and the job delivery time is proportional to its waiting time. The objective is to find jointly the optimal job sequence, optimal flow allowance value (i.e., optimal common waiting time) and optimal resource allocation to minimise a total cost comprising the earliness, tardiness, due-window-related and resource consumption costs. We consider two models of the job processing time function and provide polynomial-time solution algorithms for the corresponding problems. We also provide a more efficient solution algorithm for a special case of the problem. [Received: 11 January 2014; Revised: 19 December 2014; Accepted: 18 January 2015]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.