A hybrid heuristic and linear programming approach to multi-product machine scheduling

DOI10.1016/S0377-2217(97)00153-7zbMath0948.90138MaRDI QIDQ1303542

Robert C. Leachman, José Fernando Gonçalves

Publication date: 16 September 1999

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

zbMATH Keywords

integer linear programmingmulti-product single-machineoptimal economic lotsoptimal subsequencescheduling economic lots

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Lower bounds for the economic lot scheduling problem using aggregation
• Multi-item lot size determination and scheduling under capacity constraints
• Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
• Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
• The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
• Lot Sizing and Sequencing for N Products on One Facility
• Production Runs for Multiple Products: The Two-Product Heuristic
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• Economic Lot Scheduling Problem with Raw Material Considerations
• On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
• A Heuristic Scheduling Policy for Multi-Item, Multi-Machine Production Systems with Time-Varying, Stochastic Demands
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
• A Dynamic Programming Approach to a Lot Size Scheduling Problem