Paper Info
Title
Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior.
Abstract
•A nonlinear integer programming model of dynamic lotsizing with queueing.•A rounding heuristic and a feasibility pump heuristic are given.•The rounding procedure produces good solutions in less time than the feasibility pump.
Year
DOI
Venue
2018
10.1016/j.cor.2018.07.019
Computers & Operations Research
Keywords
Field
DocType
Nonlinear integer programming,Dynamic lot-sizing,Production planning,Queueing,Rounding heuristic,Feasibility pump heuristic,Surrogate problem method
Integer,Mathematical optimization,Heuristic,Shortest path problem,Local optimum,Rounding,Heuristics,Queueing theory,Sizing,Mathematics
Journal
Volume
ISSN
Citations 
100
0305-0548
0
PageRank 
References 
Authors
0.34
14
3
Name
Order
Citations
PageRank
Yongha Kang100.34
Erinç Albey2113.68
Reha Uzsoy399687.36