The mixed shop scheduling problem (Q1067989)
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 3928707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The mixed shop scheduling problem |
scientific article; zbMATH DE number 3928707 |
Statements
The mixed shop scheduling problem (English)
0 references
1985
0 references
The two-machine shop scheduling problem has been solved by Johnson and Gonzalez/Sahni if the jobs are flow shop type and open shop type, respectively. The authors develop a solution procedure where both job types occur. While this problem has been solved by Jackson for given processing orders of the two machines, the new procedure allows the flexibility of the processing order.
0 references
two-machine shop scheduling
0 references
flow shop
0 references
open shop
0 references
0.8318971991539001
0 references
0.8043742179870605
0 references
0.7988439798355103
0 references
0.7960790395736694
0 references
0.7928695678710938
0 references
