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

DOI10.1016/j.cor.2008.12.001zbMath1160.90467OpenAlexW2083939185WikidataQ57717975 ScholiaQ57717975MaRDI QIDQ1017445

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

schedulingheuristictotal completion timedominance relationassembly flowshop

Mathematics Subject Classification ID

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

Related Items

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ 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 third comprehensive survey on scheduling problems with setup times/costs ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Minimizing the total completion time in a distributed two stage assembly system with setup times ⋮ The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic ⋮ Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Lot streaming for a two-stage assembly system in the presence of handling costs ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs ⋮ A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times

Cites Work

• Unnamed Item
• 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 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 branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• The significance of reducing setup times/setup costs
• 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
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
• The Complexity of Flowshop and Jobshop Scheduling
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Optimal scheduling of the 3-machine assembly-type flow shop
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation