The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

This paper focuses on the continuous assignment problem with the eventual aim to solve scheduling problems with irregular cost functions. It consists of partitioning a region of R d into subregions of prescribed volumes so that the total cost is minimized. The dual problem of the continuous assignme...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	INFORMS journal on computing Jg. 16; H. 2; S. 198 - 208
1. Verfasser:	Sourd, Francis
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum INFORMS 22.03.2004 Institute for Operations Research and the Management Sciences
Schlagworte:	Assignment problem Branch & bound algorithms branch and bound continuous linear programming earliness and tardiness Job shops Linear programming Production scheduling Studies
ISSN:	1091-9856, 1526-5528, 1091-9856
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!