Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior

DOI10.1016/j.cor.2018.07.019zbMath1458.90232OpenAlexW2884832566MaRDI QIDQ1782155

Yongha Kang, Reha Uzsoy, Erinc Albey

Publication date: 18 September 2018

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

Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.019

zbMATH Keywords

queueingnonlinear integer programmingproduction planningdynamic lot-sizingfeasibility pump heuristicrounding heuristicsurrogate problem method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (1)

Cost minimizing planning of container inspection and repair in multiple facilities

Uses Software

• KNITRO
• FEASPUMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem
• Simultaneous determination of lot size and production rate at capacity-constrained multiple-product systems
• Generalized surrogate problem methodology for online stochastic discrete optimization
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Capacitated lot-sizing with extensions: a review
• A feasibility pump for mixed integer nonlinear programs
• Multi-item batching heuristics for minimization of queueing delays
• A polyhedral branch-and-cut approach to global optimization
• Minimizing the error bound for the dynamic lot size model
• A storm of feasibility pumps for nonconvex MINLP
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Improving the feasibility pump
• A comparison of methods for lot-sizing in a rolling horizon environment
• Single item lot sizing problems
• The feasibility pump
• A heuristic to control integrated multi-product multi-machine production-inventory systems with job shop routings and stochastic arrival, set-up and processing times
• Dynamic Version of the Economic Lot Size Model
• ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling
• Ending Inventory Valuation in Multiperiod Production Scheduling
• A Dynamic Lot-Sizing Model with Demand Time Windows
• Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• The Deterministic Dynamic Product Cycling Problem
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
• Note—Performance Bounds for Lot Sizing Heuristics
• Lot Sizes, Lead Times and In-Process Inventories
• Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
• Deterministic Production Planning: Algorithms and Complexity
• Computational Complexity of the Capacitated Lot Size Problem
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• Determination of batch size at a bottleneck machine in manufacturing systems
• Production Planning by Mixed Integer Programming
• Online surrogate problem methodology for stochastic discrete resource allocation problem.

This page was built for publication: Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior