Abstract
In the paper a job shop and flow shop scheduling problems with availability time constraint for maintenance are considered. Unavailability time due to maintenance is estimated basing on information about predicted Mean Time To Failure/To First Failure and Mean Time of Repair of a machine. Maintenance actions are introduced into a schedule to keep the machine available in a good operation condition. The efficiency of predictive schedules (PS) is evaluated using criteria: makespan, flow time, total tardiness, idle time. The efficiency of reactive schedules (RSs) is evaluated using criteria: solution and quality robustness. For basic schedule generation Multi Objective Immune Algorithm is applied. For predictive scheduling Minimal Impact of Disturbed Operation on the Schedule is applied. After doing computer simulations for the job shop scheduling problem following question arises: do dominated Pareto optimal basic schedules achieve better PSs? Although a single Pareto-optimal solution is achieved on Pareto-optimal frontier three different schedules have the same quality in the flow shop scheduling problem. The question is: which schedule is the most robust solution?
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 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.
