Solving permutation flow shop scheduling problem with sequence-independent setup time

DOI10.1155/2020/7132469zbMath1442.90066OpenAlexW3000793732WikidataQ126301636 ScholiaQ126301636MaRDI QIDQ2176034

Said Aqil, Karam Allali, Jabrane Belabid

Publication date: 30 April 2020

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/7132469

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Efficiency thresholds of group based job scheduling in HPC systems ⋮ Group based job scheduling to increase the high-performance computing efficiency ⋮ Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates

Uses Software

• MOEA/D

Cites Work

• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A fast tabu search algorithm for the permutation flow-shop problem
• A new constructive heuristic for the flowshop scheduling problem
• A genetic algorithm for flowshop sequencing
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
• A comprehensive review and evaluation of permutation flowshop heuristics
• 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
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Two MILP models for the N × M SDST flowshop sequencing problem
• Optimal two- and three-stage production schedules with setup times included
• New MILP models for the permutation flowshop problem
• The Complexity of Flowshop and Jobshop Scheduling
• Comparative evaluation of MILP flowshop models
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues