Solving permutation flow shop scheduling problem with sequence-independent setup time
Summary: In this paper, we study the resolution of a permutation flow shop problem with sequence-independent setup time. The objective is to minimize the maximum of job completion time, also called the makespan. In this contribution, we propose three methods of resolution, a mixed-integer linear programming (MILP) model; two heuristics, the first based on Johnson's rule and the second based on the NEH algorithm; and finally two metaheuristics, the iterative local search algorithm and the iterated greedy algorithm. A set of test problems is simulated numerically to validate the effectiveness of our resolution approaches. For relatively small-size problems, it has been revealed that the adapted NEH heuristic has the best performance than that of the Johnson-based heuristic. For the relatively medium and large problems, the comparative study between the two metaheuristics based on the exploration of the neighborhood shows that the iterated greedy algorithm records the best performances.
- Heuristics for permutation flow shop scheduling with batch setup times
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- An improved NEH-based heuristic for the permutation flowshop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- A new constructive heuristic for the flowshop scheduling problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Comparative evaluation of MILP flowshop models
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- scientific article; zbMATH DE number 7722 (Why is no real title available?)
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- New MILP models for the permutation flowshop problem
- Optimal two- and three-stage production schedules with set-up time included
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- Some efficient heuristic methods for the flow shop sequencing problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- The Complexity of Flowshop and Jobshop Scheduling
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- Two MILP models for the N × M SDST flowshop sequencing problem
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- Diversity of processing times in permutation flow shop scheduling problems
- Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates
- On VNS-GRASP and iterated greedy metaheuristics for solving hybrid flow shop scheduling problem with uniform parallel machines and sequence independent setup time
- Group based job scheduling to increase the high-performance computing efficiency
- Efficiency thresholds of group based job scheduling in HPC systems
- scientific article; zbMATH DE number 5247431 (Why is no real title available?)
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- Scale ratio tuning of group based job scheduling in HPC systems
- Advanced metaheuristics for bi-criteria optimization in a distributed blocking flow shop problem with setup times
- The fourth comprehensive review of scheduling problems with setup times
This page was built for publication: Solving permutation flow shop scheduling problem with sequence-independent setup time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176034)
