An algorithm for minimizing setups in precedence constrained scheduling (Q1069848)
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: An algorithm for minimizing setups in precedence constrained scheduling |
scientific article; zbMATH DE number 3936909
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for minimizing setups in precedence constrained scheduling |
scientific article; zbMATH DE number 3936909 |
Statements
An algorithm for minimizing setups in precedence constrained scheduling (English)
0 references
1985
0 references
Consider a set of tasks to be scheduled on a single processor subject to precedence constraints. A setup occurs when a task is performed immediately after another task which is not its predecessor. The general problem is to find a schedule minimizing the number of setups. We present a decomposition approach for this problem. This leads to new complexity results and the identification of new classes of precedence constraints for which the problem is efficiently solvable.
0 references
minimizing setups
0 references
single processor
0 references
precedence constraints
0 references
decomposition approach
0 references
