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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:INFORMS journal on computing Ročník 16; číslo 2; s. 198 - 208
Hlavní autor: Sourd, Francis
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 22.03.2004
Institute for Operations Research and the Management Sciences
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 assignment problem is an unconstrained maximization of a non-smooth concave function. The preemptive variant of the scheduling problem with irregular cost functions corresponds to the one-dimensional continuous assignment problem and a lower bound for the non-preemptive variant can be derived. It is computationally tested in a branch-and-bound algorithm.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.1030.0034