A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
From MaRDI portal
Publication:2217032
DOI10.1155/2020/8833645zbMath1459.90099OpenAlexW3110402548MaRDI QIDQ2217032
Publication date: 18 December 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/8833645
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Two-machine flow shop scheduling problems with minimal and maximal delays
- The two-machine sequence dependent flowshop scheduling problem
- Three-machine flow shop scheduling with overlapping waiting time constraints
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant
- Optimal two- and three-stage production schedules with setup times included
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Total Tardiness Problem: Review and Extensions
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
This page was built for publication: A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
