Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates
From MaRDI portal
Publication:6094571
DOI10.1080/0305215x.2021.1961763zbMath1523.90194OpenAlexW3194011336MaRDI QIDQ6094571
Chin-Chia Wu, Xinyue Wang, Tao Ren, Danyu Bai, Meiting Guo, Lin Lin, Tianyi Liu
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2021.1961763
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
- Benchmarks for basic scheduling problems
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- Minimising makespan in the two-machine flow-shop with release times
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The effectiveness of the longest delivery time rule for the flow shop delivery time problem
- New heuristics for flow shop problem to minimize makespan
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- Minimizing tardiness in a two-machine flow-shop
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
