Single facility scheduling with multiple job classes (Q1105481)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single facility scheduling with multiple job classes |
scientific article; zbMATH DE number 4059103
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single facility scheduling with multiple job classes |
scientific article; zbMATH DE number 4059103 |
Statements
Single facility scheduling with multiple job classes (English)
0 references
1988
0 references
The one-machine scheduling problem aiming at minimizing the mean flow time is considered. The jobs set is divided into K classes. The processing of a job from class s immediately after the processing of a job from class r requires switching time \(\alpha_{rs}>0\) \((\alpha_{rr}=0)\). A heuristic \(O(nK+n\) log n) algorithm is proposed, where n is the number of jobs. The author failed to establish the worst- case bound for the algorithm. The results of numerical experiments are reported.
0 references
one-machine scheduling
0 references
mean flow time
0 references
switching time
0 references
heuristic
0 references
