A systematic literature review on no-idle flow shop scheduling problem
From MaRDI portal
Publication:6130678
DOI10.1007/s43069-024-00304-0MaRDI QIDQ6130678
Unnamed Author, Unnamed Author
Publication date: 3 April 2024
Published in: SN Operations Research Forum (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- Two-stage hybrid flowshop scheduling with simultaneous processing machines
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- 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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- A systematic review of multi-objective hybrid flow shop scheduling
This page was built for publication: A systematic literature review on no-idle flow shop scheduling problem