Scheduling parallel processors to minimize setup time (Q1820684)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3995437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling parallel processors to minimize setup time |
scientific article; zbMATH DE number 3995437 |
Statements
Scheduling parallel processors to minimize setup time (English)
0 references
1987
0 references
The problem of scheduling parallel processors in a make-to-stock environment with sequence-dependent setup costs is considered. A new algorithm which formulates a series of 0/1 integer subproblems is proposed and contrasted with an earlier formulation. Parallels between the subproblem formulations and generalized network are discussed.
0 references
scheduling parallel processors
0 references
0.8929989337921143
0 references
0.8086898922920227
0 references
0.8065717816352844
0 references
0.804022490978241
0 references
0.7961157560348511
0 references
