Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan

DOI10.1016/J.COR.2008.11.018MaRDI QIDQ1010280zbMATH OpenOpenAlexFDO

Authors Fawaz S. Al-Anzi, Ali Allahverdi

Publication date 3 April 2009

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2008.11.018

zbMATH Keywords

assembly flowshopbicriteriaheuristicmakespanmaximum lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• A hybrid tabu search heuristic for the two-stage assembly scheduling problem
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic

Cites work

• A branch and bound algorithm for the two-stage assembly scheduling problem
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A survey of scheduling problems with setup times or costs
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Optimal two- and three-stage production schedules with set-up time included
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• Scheduling flow shops using differential evolution algorithm
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

Cited in

(11)

• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
• A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• A data intensive heuristic approach to the two-stage streaming scheduling problem
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
• Two-stage assembly flow shop scheduling based on a hybrid VNS-EM algorithm
• Lot streaming for a two-stage assembly system in the presence of handling costs
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times

This page was built for publication: Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan

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