Flowshop with additional resources during setups: mathematical models and a GRASP algorithm
From MaRDI portal
Publication:6109559
DOI10.1016/j.cor.2023.106192MaRDI QIDQ6109559
Federico Perea, Fulgencia Villa, Eva Vallada, Juan C. Yepes-Borrero
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Operations research and management science (90Bxx)
Cites Work
- The third comprehensive survey on scheduling problems with setup times/costs
- Breakthroughs in statistics. Volume II: Methodology and distribution
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- A comprehensive review of flowshop group scheduling literature
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Greedy randomized adaptive search procedures
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
- A survey of scheduling problems with setup times or costs
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- General flow-shop scheduling with resource constraints
- The Complexity of Flowshop and Jobshop Scheduling
- Use of Ranks in One-Criterion Variance Analysis
This page was built for publication: Flowshop with additional resources during setups: mathematical models and a GRASP algorithm
