Minimizing makespan for a no-wait flowshop using genetic algorithm
From MaRDI portal
Publication:746438
DOI10.1007/s12046-012-0105-1zbMath1322.90032OpenAlexW2022409468MaRDI QIDQ746438
Abdul Munem Khan, Imran Ali Chaudhry
Publication date: 16 October 2015
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://www.ias.ac.in/describe/article/sadh/037/06/0695-0707
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On no-wait and no-idle flow shops with makespan criterion
- A genetic algorithm for flowshop sequencing
- New heuristics for no-wait flowshops to minimize makespan.
- Approximative procedures for no-wait job shop scheduling.
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
- Heuristic algorithms for continuous flow-shop problem
- Solvable cases of the flow-shop problem without interruptions in job processing
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Solutions to the Constrained Flowshop Sequencing Problem
- Ordonnancements à contraintes disjonctives
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Heuristic for no-wait flow shops with makespan minimization
- Flowshop-scheduling problems with makespan criterion: a review
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
This page was built for publication: Minimizing makespan for a no-wait flowshop using genetic algorithm
