Minimizing makespan for a no-wait flowshop using genetic algorithm

DOI10.1007/S12046-012-0105-1zbMATH Open1322.90032OpenAlexW2022409468MaRDI QIDQ746438FDOQ746438

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

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

zbMATH Keywords

schedulingflowshopno-waitgenetic algorithm (GA)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
• A survey of scheduling problems with no-wait in process

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)