Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length (Q1062615): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(85)90129-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968233780 / rank | |||
Normal rank | |||
Revision as of 09:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length |
scientific article |
Statements
Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length (English)
0 references
1985
0 references
The problem considered is one of production scheduling of lots of unit- time operations on identical machines. Operations are precedence related and form a tree. For each operation two parameters are specified: the first giving the required number of operations (units of a given product) to be made and the second defining for each arc (i,j) the number of units of product i used to produce a unit of product j. The objective is to find a schedule of minimum length. A polynomial-time algorithm based on Hu's algorithm for scheduling trees is given.
0 references
parallel machines
0 references
production scheduling
0 references
unit-time operations
0 references
identical machines
0 references
minimum length
0 references
polynomial-time algorithm
0 references
