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

DOI10.1016/j.cor.2008.11.018zbMath1179.90117OpenAlexW2031161030MaRDI QIDQ1010280

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

makespanheuristicmaximum latenessbicriteriaassembly flowshop

Mathematics Subject Classification ID

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

Related Items (5)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ A data intensive heuristic approach to the two-stage streaming scheduling problem ⋮ Lot streaming for a two-stage assembly system in the presence of handling costs ⋮ 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

Cites Work

• Scheduling flow shops using differential evolution algorithm
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• 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
• A survey of scheduling problems with setup times or costs
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Optimal two- and three-stage production schedules with setup times included
• 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

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