Minimizing makespan for a no-wait flowshop using genetic algorithm

DOI10.1007/S12046-012-0105-1MaRDI QIDQ746438zbMATH OpenOpenAlexFDO

Authors Imran Ali Chaudhry, Abdul Munem Khan

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

zbMATH Keywords

flowshopgenetic algorithm (GA)no-waitscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 6780786
• A genetic algorithm for flowshop sequencing
• New heuristics for no-wait flowshops to minimize makespan.
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem

Cites work

• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• A genetic algorithm for flowshop sequencing
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
• Approximative procedures for no-wait job shop scheduling.
• Flowshop-scheduling problems with makespan criterion: a review
• Heuristic algorithms for continuous flow-shop problem
• Heuristic for no-wait flow shops with makespan minimization
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• New heuristics for no-wait flowshops to minimize makespan.
• On no-wait and no-idle flow shops with makespan criterion
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Ordonnancements à contraintes disjonctives
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• Solutions to the Constrained Flowshop Sequencing Problem
• Solvable cases of the flow-shop problem without interruptions in job processing
• Some local search algorithms for no-wait flow-shop problem with makespan criterion
• The Three-Machine No-Wait Flow Shop is NP-Complete

Cited in

(6)

• A survey of scheduling problems with no-wait in process
• scientific article; zbMATH DE number 5151911 (Why is no real title available?)
• Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
• scientific article; zbMATH DE number 6780786 (Why is no real title available?)
• scientific article; zbMATH DE number 5221570 (Why is no real title available?)
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis

This page was built for publication: Minimizing makespan for a no-wait flowshop using genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746438)