A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
From MaRDI portal
Publication:1761140
DOI10.1016/j.cor.2011.10.024zbMath1251.90133OpenAlexW2083933508MaRDI QIDQ1761140
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.024
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
A differential evolution algorithm with self-adaptive strategy and control parameters based on symmetric Latin hypercube design for unconstrained optimization problems ⋮ A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem ⋮ A systematic literature review on no-idle flow shop scheduling problem ⋮ Benders decomposition for the mixed no-idle permutation flowshop scheduling problem ⋮ A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Cites Work
- Scheduling flow shops using differential evolution algorithm
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- On no-wait and no-idle flow shops with makespan criterion
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- The flow shop problem with no-idle constraints: a review and approximation
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Optimal two- and three-stage production schedules with setup times included
- The Complexity of Flowshop and Jobshop Scheduling
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
This page was built for publication: A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
