Multi-Objective Hybrid Flow-Shop Scheduling in Parallel Sequential Mode While Considering Handling Time and Setup Time
Source abstract
Abstract
Hybrid flow-shop scheduling based on the parallel sequential movement mode (HFSP-PSMM) is an extended application of hybrid flow-shop scheduling that ensures that the equipment works continuously during the processing cycle. However, current research has only investigated the flow-shop scheduling of single-equipment processing, and ignores the effect of auxiliary time. Therefore, this paper investigates a multi-equipment hybrid flow-shop scheduling problem based on the parallel sequential movement mode and considers the setup time and handling time. The mathematical model of the HFSP-PSMM was developed with the handling and makespan numbers as the optimization objectives. The NSGA-II-V based on the NSGA-II was designed by combining the problem characteristics. New crossover, mutation, and selection strategies were proposed and variable neighborhood search operations were implemented for the optimal set of Pareto solutions. Finally, through an algorithm comparison, performance testing, and an example simulation, the effectiveness of the NSGA-II-V for solving the HFSP-PSMM was verified.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Scheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization · Optimization and Packing Problems
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Modern Post, Beijing University of Posts and Telecommunications, Haidian District, Beijing 100876, China
Funding
the Humanities and Social Science Youth foundation of the Ministry of Education of China
References (39)
Show source-provided references
1. Integrated model for pricing, delivery time setting, and scheduling in make-to-order environments10.1007/s40092-017-0205-y ↗
2. Dynamic pooling of make-to-stock and make-to-order operations10.1016/j.ijpe.2013.01.012 ↗
3. Review on hybrid flow shop scheduling problems
4. A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling10.1016/j.jclepro.2019.03.155 ↗
5. A simulated annealing/local search to minimize the makespan and total tardiness on a hybrid flowshop10.1007/s00170-012-4031-5 ↗
6. Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm10.1016/j.amc.2014.06.019 ↗
7. A TSP-GA multi-objective algorithm for flow-shop scheduling10.1007/s00170-003-1731-x ↗
8. An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors–A case study10.1016/j.cor.2019.104812 ↗
9. Hybrid flowshop scheduling model and its genetic algorithm
10. Multi-objective flow shop batch scheduling with separable processing time and setup time under parallel-sequence-transfer mode
11. Hybrid Genetic Algorithm for Flow Shop Sequencing Problem
12. A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion10.1016/j.cor.2011.10.024 ↗
13. Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem10.1016/j.neucom.2013.05.063 ↗
14. A Discrete Firefly Algorithm for Minimizing the Makespan in the No-idle Permutation Flow Shops
15. A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion10.1016/j.knosys.2014.11.016 ↗
16. Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion10.1016/j.asoc.2017.01.017 ↗
17. A discrete fireworks algorithm for solving no-idle permutation flow shop problem
18. A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling10.1016/j.swevo.2019.100557 ↗
19. A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times10.1016/j.eswa.2020.113360 ↗
20. Solving flow shop scheduling problem using a parallel genetic algorithm10.1016/j.protcy.2012.02.073 ↗
21. Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system10.1016/j.cie.2018.09.035 ↗
22. Multi-objective genetic algorithm for solving multi-objective flow-shop inverse scheduling problems10.3901/JME.2016.22.186 ↗
23. A hybrid genetic algorithm and tabu search for minimizing makespan in flow shop scheduling problem
24. Energy-efficient hybrid flow-shop scheduling considering job batching
25. Multi-objective flow shop optimal scheduling considering worker’s load
26. research on multi objective scheduling of hybrid flow production shop considering sequence setting time
27. Improved NSGA- II algorithm for hybrid flow shop scheduling problem with multi-objective NSGA-II
28. Chen, W., Wang, J., Yu, G., and Hu, Y. (2022). Energy-Efficient Hybrid Flow-Shop Scheduling under Time-of-Use and Ladder Electricity Tariffs. Appl. Sci., 12.10.3390/app12136456 ↗
29. Optimism of job shop scheduling with multi times
30. Co-evolutionary cultural genetic algorithm for group scheduling of mixed flow shop with transport time
31. Multi-queue Limited Buffer Scheduling Problems in Flexible Flow Shop with Setup Times10.3901/JME.2019.24.236 ↗
32. Two-Machine Flexible Flow-Shop Scheduling with Setup Times10.3923/jas.2008.2217.2225 ↗
33. Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness10.1007/s00170-008-1569-3 ↗
34. An improved simulated annealing for hybrid flowshops with se-quence-dependent setup and transportation times to minimize total completion time and total tardiness10.1016/j.eswa.2008.09.063 ↗
35. Hybrid genetic optimization algorithm for multiprocessor task scheduling in flexible flow-shops with transportation
36. A fast and elitist multiobjective genetic algorithm: NSGA-II10.1109/4235.996017 ↗
37. An Exact Method for Solving the Multi-Processor Flow-Shop10.1051/ro:2000103 ↗
38. Benchmarks for basic scheduling problems10.1016/0377-2217(93)90182-M ↗
39. A Discrete Sine Optimization Algorithm for No-Idle Flow-Shop Scheduling Problem