A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines

DOI10.1016/j.ejor.2006.07.027zbMath1121.90059OpenAlexW2088648566MaRDI QIDQ881563

Kyparisis, George J., Christos P. Koulamas

Publication date: 30 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.027

zbMATH Keywords

schedulingflow shopapproximation algorithmsuniform machinesabsolute performance bound

Mathematics Subject Classification ID

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

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 ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ The production scheduling problem in a multi-page invoice printing system ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the two-stage assembly scheduling problem
• On some geometric methods in scheduling theory: A survey
• Minimizing makespan in hybrid flowshops
• Scheduling on uniform parallel machines to minimize maximum lateness
• Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage
• 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
• Flexible flow shop scheduling with uniform parallel machines
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Assembly-Line Scheduling with Concurrent Operations and Parallel Machines
• 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
• The three-stage assembly flowshop scheduling problem

This page was built for publication: A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines