A Lagrangean decomposition solution to a single line multiproduct scheduling problem
From MaRDI portal
Publication:1342036
DOI10.1016/0377-2217(94)90393-XzbMath0812.90058MaRDI QIDQ1342036
Publication date: 9 February 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (4)
Maximal covering code multiplexing access telecommunication networks ⋮ Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan ⋮ Hierarchical design of an integrated production and 2-echelon distribution system
Cites Work
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- The Deterministic Dynamic Product Cycling Problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean decomposition for integer programming : theory and applications
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
- Algorithm 562: Shortest Path Lengths [H]
- Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- Dynamic Production Scheduling for a Process Industry
- Validation of subgradient optimization
- Minimum Change-Over Scheduling of Several Products on One Machine
- Optimum Production Scheduling of Multicommodity in Flow Line
This page was built for publication: A Lagrangean decomposition solution to a single line multiproduct scheduling problem
