Abstract
The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.
Highlights
Scheduling is arranging and planning sequence of event to complete the work
The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics
Flexible flow shop or hybrid flow shop, is the one of the most important classes of scheduling which defined as a flow shop with parallel machines and flexible flow line
Summary
Scheduling is arranging and planning sequence of event to complete the work. The goal is to utilize the resources optimally while reaching targets. To best use of resources, Jolai et al (2009) introduced no-wait flexible flow line scheduling problem with time windows and job rejection which is, in turn, an extension of production and delivery scheduling He presented a similar method known as integer-linear programming model and genetic algorithm process as well. To reduce makespan, Ramezani et al (2013) suggested no-wait scheduling problem focused on set up time which is anticipatory and sequence dependent in a flexible flow shop environment with two sets of same machines in parallel They introduced it as a novel method since it was NP-hard. Aiming to minimize average of tardiness and time, Rahimi-Vahed et al (2008) offered a bi-criteria no-wait flow shop scheduling problem What they suggest is a new method named multi-objective scatter search as a metaheuristic algorithm for finding near optimal Pareto frontier.
Sign-in/Register to view highlights & summary 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.
