Abstract
In this paper, we consider the scheduling a set of deteriorating jobs on a single processor. We propose a model which reflects real life situations in which the processing time of jobs change depending on its initial processing time (deteriorating jobs) and activities, such as machine maintenance or a break for workers. A rate-modifying activity (rma) is a maintenance activity given to a machine to restore it to its original state. The general problem we deal with in this study is to determine the job sequence, the number of rmas, and rma positions within the work sequence. We formulate a unique integer program to solve this model for makespan and total completion time objectives. We also propose efficient heuristic algorithms for solving large size problems for both makespan and total completion time objectives.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
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.
