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...

Full description

Saved in:

Bibliographic Details
Published in:	INFORMS journal on computing Vol. 16; no. 2; pp. 198 - 208
Main Author:	Sourd, Francis
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 22.03.2004 Institute for Operations Research and the Management Sciences
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!