Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
type: Item
instance of: scholarly article
title: Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
zbMATH Open document ID: 1458.90232
author: Yongha Kang
author: Erinc Albey
author: Reha Uzsoy
published in: Computers \& Operations Research
publication date: 2018-09-18T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6938891
zbMATH Keywords: nonlinear integer programming
zbMATH Keywords: dynamic lot-sizing
zbMATH Keywords: production planning
zbMATH Keywords: queueing
zbMATH Keywords: rounding heuristic
zbMATH Keywords: feasibility pump heuristic
zbMATH Keywords: surrogate problem method
describes a project that uses: KNITRO
describes a project that uses: FEASPUMP
MaRDI profile type: Publication
full work available at URL: j.cor.2018.07.019
OpenAlex ID: W2884832566
cites work: Improving the feasibility pump
cites work: Q3056948
cites work: Note—Performance Bounds for Lot Sizing Heuristics
cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
cites work: The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: A feasibility pump for mixed integer nonlinear programs
cites work: Single item lot sizing problems
cites work: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
cites work: Q5485392
cites work: Q5493572
cites work: A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem
cites work: Minimizing the error bound for the dynamic lot size model
cites work: A storm of feasibility pumps for nonconvex MINLP
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
cites work: The feasibility pump
cites work: Ending Inventory Valuation in Multiperiod Production Scheduling
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Q4198056
cites work: Online surrogate problem methodology for stochastic discrete resource allocation problem.
cites work: Generalized surrogate problem methodology for online stochastic discrete optimization
cites work: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
cites work: Lot Sizes, Lead Times and In-Process Inventories
cites work: Q3995531
cites work: Multi-item batching heuristics for minimization of queueing delays
cites work: The Deterministic Dynamic Product Cycling Problem
cites work: Q4101255
cites work: Determination of batch size at a bottleneck machine in manufacturing systems
cites work: Simultaneous determination of lot size and production rate at capacity-constrained multiple-product systems
cites work: ACLIPS: A capacity and lead time integrated procedure for scheduling
cites work: Q5630824
cites work: A Dynamic Lot-Sizing Model with Demand Time Windows
cites work: Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
cites work: Production Planning by Mixed Integer Programming
cites work: Capacitated lot-sizing with extensions: a review
cites work: Q5692145
cites work: Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
cites work: A comparison of methods for lot-sizing in a rolling horizon environment
cites work: A heuristic to control integrated multi-product multi-machine production-inventory systems with job shop routings and stochastic arrival, set-up and processing times
cites work: Q4258215
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
cites work: Dynamic version of the economic lot size model
DOI: 10.1016/J.COR.2018.07.019
Wikidata QID: Q129505360
description: scientific article; zbMATH DE number 6938891