Hybrid methods for lot sizing on parallel machines

We consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines, and apply Dantzig–Wolfe decomposition to a strong reformulation of the problem. Unlike in the traditional approach where the linking constraints are the capacity constraints, we use the fl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2015-11, Vol.63, p.136-148
Hauptverfasser:	Fiorotto, Diego Jacinto, de Araujo, Silvio Alexandre, Jans, Raf
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer programs Dantzig-Wolfe decomposition Heuristic High performance systems Hybrid methods Joining Lagrange multiplier Lagrangian relaxation Linking Lot sizing Lower bounds Mathematical models Mathematical problems Parallel machines Production methods Production scheduling Reformulation Software Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!