Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems (Q3964310): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.7.4.532 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152894907 / rank | |||
Normal rank | |||
Latest revision as of 20:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems |
scientific article |
Statements
Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems (English)
0 references
1982
0 references
minimal length non-preemptive scheduling problem
0 references
three-stage flow shop
0 references
polynomial scheduling algorithms
0 references
NP-completeness
0 references
