Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates
DOI10.1080/0305215X.2021.1961763zbMATH Open1523.90194OpenAlexW3194011336MaRDI QIDQ6094571FDOQ6094571
Authors: Tao Ren, Xinyue Wang, Tianyi Liu, Chin-Chia Wu, Danyu Bai, Lin Lin, Meiting Guo 
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
Recommendations
- A local search algorithm for the flow shop scheduling problem with release dates
- Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems
- Minimizing maximum lateness in a flow shop subject to release dates
- Minimizing makespan in a two-machine flowshop scheduling with batching and release time
- Optimal results and numerical simulations for flow shop scheduling problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal two- and three-stage production schedules with set-up time included
- Benchmarks for basic scheduling problems
- Flowshop scheduling research after five decades
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- Minimising makespan in the two-machine flow-shop with release times
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- New heuristics for flow shop problem to minimize makespan
- Minimizing tardiness in a two-machine flow-shop
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
- The effectiveness of the longest delivery time rule for the flow shop delivery time problem
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Cited In (1)
This page was built for publication: Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094571)
