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

Name: Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
Author: Kang, Y., Albey, Erinç, Uzsoy, R.

İsim	Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
Yazar	Kang, Y., Albey, Erinç, Uzsoy, R.
Basım Tarihi:	2018-12
Basım Yeri	- Elsevier
Konu	Nonlinear integer programming, Dynamic lot-sizing, Production planning, Queueing, Rounding heuristic, Feasibility pump heuristic, Surrogate problem method
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0305-0548
Kayıt Numarası	b9b16590-5824-42ab-a17b-663fd21cfee6
Lokasyon	Industrial Engineering
Tarih	2018-12
Örnek Metin	We present heuristics for solving a difficult nonlinear integer programming (NIP) model arising from a multi-item single machine dynamic lot-sizing problem. The heuristic obtains a local optimum for the continuous relaxation of the NIP model and rounds the resulting fractional solution to a feasible integer solution by solving a series of shortest path problems. We also implement two benchmarks: a version of the well-known Feasibility Pump heuristic and the Surrogate Method developed for stochastic discrete optimization problems. Computational experiments reveal that our shortest path based rounding procedure finds better production plans than the previously developed myopic heuristic and the benchmarks.
DOI	10.1016/j.cor.2018.07.019
Cilt	100

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

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

Yazar Kang, Y., Albey, Erinç, Uzsoy, R.

Basım Tarihi 2018-12

Basım Yeri - Elsevier

Konu Nonlinear integer programming, Dynamic lot-sizing, Production planning, Queueing, Rounding heuristic, Feasibility pump heuristic, Surrogate problem method

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0305-0548

Kayıt Numarası b9b16590-5824-42ab-a17b-663fd21cfee6

Lokasyon Industrial Engineering

Tarih 2018-12

Örnek Metin We present heuristics for solving a difficult nonlinear integer programming (NIP) model arising from a multi-item single machine dynamic lot-sizing problem. The heuristic obtains a local optimum for the continuous relaxation of the NIP model and rounds the resulting fractional solution to a feasible integer solution by solving a series of shortest path problems. We also implement two benchmarks: a version of the well-known Feasibility Pump heuristic and the Surrogate Method developed for stochastic discrete optimization problems. Computational experiments reveal that our shortest path based rounding procedure finds better production plans than the previously developed myopic heuristic and the benchmarks.

DOI 10.1016/j.cor.2018.07.019

Cilt 100