Abstract
This article addresses the single machine scheduling problem in which the actual processing time of jobs change depending on an elapsed time between its start time and a released time or completion time of a recent maintenance activity. The introduced problem reflects production industry of chemical and metallurgical processes. The objective of this problem is to determine a sequence of jobs and the number and positions of maintenance activities on a single machine to minimize the makespan. We introduce a mixed integer linear programming (MILP) model for the problem. We then propose column generation (CG) algorithms by using Dantzig-Wolfe decomposition approach. The performances of the CG algorithms are evaluated with randomly generated examples.
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 callDisclaimer: 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.
