Abstract

As traditional flow shop scheduling model is usually designed for deterministic production environment and under single optimization objective, this paper considers a permutation flow shop scheduling problem with uncertain processing time so as to overcome the deficiency. Moreover, a multi-objective robust scheduling model is constructed to minimize the tardiness and total completion time under min-max regret criterion. Directed graph is used to analyze the scenario of the maximum regret value scenario (i.e. the worst-case scenario). Finally, genetic algorithm is applied to solve this robust scheduling model. Through the experimental simulation results, the proposed model shows its efficiency and effectiveness.

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 call

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.