The two-stage assembly scheduling problem to minimize total completion time with setup times

DOI10.1016/J.COR.2008.12.001zbMATH Open1160.90467DBLPjournals/cor/AllahverdiA09OpenAlexW2083939185WikidataQ57717975 ScholiaQ57717975MaRDI QIDQ1017445FDOQ1017445

Ali Allahverdi, Fawaz S. Al-Anzi

Publication date: 19 May 2009

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

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

zbMATH Keywords

heuristicschedulingtotal completion timedominance relationassembly flowshop

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A survey of scheduling problems with setup times or costs
• The Complexity of Flowshop and Jobshop Scheduling
• The significance of reducing setup times/setup costs
• Scheduling flow shops using differential evolution algorithm
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly 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
• 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
• Optimal scheduling of the 3-machine assembly-type flow shop
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

Cited In (17)

• A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
• 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
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
• Lot streaming for a two-stage assembly system in the presence of handling costs
• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
• The third comprehensive survey on scheduling problems with setup times/costs
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
• Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm
• Minimizing the total completion time in a distributed two stage assembly system with setup times
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
• A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect

This page was built for publication: The two-stage assembly scheduling problem to minimize total completion time with setup times

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