Abstract
As machine maintenance is required in many industries, it is usually arranged in a planned schedule. In this paper, we discuss a scheduling problem where periodic maintenance and jobs are scheduled on a regular basis. In our research, a periodic maintenance sequence consists of several maintenance periods and each maintenance period is scheduled after a fixed time interval. The objective is to minimize the total flow time and the maximum tardiness. A heuristic that utilizes the theorem is proposed to solve the problem by providing a small set of efficient sequences. A decision-maker may choose one of the sequences according to his preference. We also propose a branch-and-bound algorithm is to find the optimal sequence. Computational results show that the presented heuristic is highly accurate and efficient.
Sign-in/Register to access full text options 
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.
