Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
From MaRDI portal
Publication:2669719
Recommendations
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Cites work
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- An iterated local search algorithm for the vehicle routing problem with backhauls
- Benchmarks for basic scheduling problems
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Flowshop/no-idle scheduling to minimize total elapsed time
- Handbook of metaheuristics
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- Iterated local search for the quadratic assignment problem
- Iterated local search for the team orienteering problem with time windows
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem.
- New hard benchmark for flowshop scheduling problems minimising makespan
- On no-wait and no-idle flow shops with makespan criterion
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- Some efficient heuristic methods for the flow shop sequencing problem
- The Complexity of Flowshop and Jobshop Scheduling
- The flow shop problem with no-idle constraints: a review and approximation
- The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Variable neighborhood search
Cited in
(6)- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- A systematic literature review on no-idle flow shop scheduling problem
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
- Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II
This page was built for publication: Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669719)
