Setting optimal due dates in a basic safe-scheduling model

We examine a basic stochastic sequencing model with due dates as decisions. The objective is to make due dates as tight as possible while meeting service level constraints. We develop an optimizing procedure using branch and bound, and we evaluate the performance of heuristic procedures as well.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2014-01, Vol.41, p.109-114
1. Verfasser:	Baker, Kenneth R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Branch & bound algorithms Computer simulation Decision making models Due dates Due-date setting Exact sciences and technology Heuristic Inventory control, production control. Distribution Mathematical models Meetings Operational research and scientific management Operational research. Management science Operations research Optimization Performance evaluation Production scheduling Safe scheduling Scheduling, sequencing Sequencing Service levels Stochastic models Stochastic sequencing Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We examine a basic stochastic sequencing model with due dates as decisions. The objective is to make due dates as tight as possible while meeting service level constraints. We develop an optimizing procedure using branch and bound, and we evaluate the performance of heuristic procedures as well.
ISSN:	0305-0548 1873-765X 0305-0548
DOI:	10.1016/j.cor.2013.07.022