The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic

DOI10.1016/j.cor.2017.07.012zbMath1391.90263OpenAlexW2738556598MaRDI QIDQ1651546

Paz Perez-Gonzalez, Jose M. Framinan

Publication date: 12 July 2018

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

Full work available at URL: https://idus.us.es/handle//11441/96664

zbMATH Keywords

heuristicsschedulingcompletion timeassembly

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (6)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ 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 ⋮ A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop

Cites Work

• Unnamed Item
• Minimizing the total completion time in a distributed two stage assembly system with setup times
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• Order scheduling in an environment with dedicated resources in parallel
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Variable neighborhood search
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• 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
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Manufacturing Scheduling Systems
• The three-stage assembly flowshop scheduling problem

This page was built for publication: The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic