Complexity of Scheduling Shops with No Wait in Process (Q3880561)
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 3685204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Scheduling Shops with No Wait in Process |
scientific article; zbMATH DE number 3685204 |
Statements
Complexity of Scheduling Shops with No Wait in Process (English)
0 references
1979
0 references
scheduling
0 references
job-machine scheduling
0 references
makespan models
0 references
flow shop
0 references
job shop
0 references
open shops
0 references
no wait in process
0 references
two processor flow shop problem
0 references
NP-hard problems
0 references
