Abstract
This work addresses the single machine and parallel machine scheduling problems, where machine is flexibly maintained and mean flow time is used as a performance measure. Machine Mk should be stopped for maintenance for a constant time wk in the schedule. The maintenance period [uk , vk ] is assumed to be set in advance, and the maintenance time wk is assumed not to exceed the maintenance period (that is, wk ≤ vk – uk ). The time uk (vk ) is the earliest (latest) time at which the machine Mk starts (stops) its maintenance. Two cases, resumable and unresumable, are considered in the single machine and parallel machine problems, respectively. Moreover, four integer programming models are developed optimally to solve the problem.
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.
