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

DOI10.1016/J.COR.2008.11.018zbMATH Open1179.90117OpenAlexW2031161030MaRDI QIDQ1010280FDOQ1010280

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

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

zbMATH Keywords

heuristicmaximum latenessmakespanbicriteriaassembly flowshop

Mathematics Subject Classification ID

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

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• A survey of scheduling problems with setup times or costs
• Scheduling flow shops using differential evolution algorithm
• 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
• 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
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

Cited In (10)

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

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)