Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times

DOI10.1016/j.ejor.2003.09.016zbMath1071.90022OpenAlexW1991758057MaRDI QIDQ706971

Daryl L. Santos, Masao Yokoyama

Publication date: 9 February 2005

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

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

zbMATH Keywords

SchedulingBranch and boundAssembly operationFlow-shopMachining operation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ Flow-shop scheduling with setup and assembly operations ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ 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 general routing problems
• Minimizing production flow time in a process and assembly job shop
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation