A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints |
scientific article; zbMATH DE number 7826453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints |
scientific article; zbMATH DE number 7826453 |
Statements
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (English)
0 references
2 April 2024
0 references
flow shop scheduling
0 references
job shop scheduling
0 references
open shop scheduling
0 references
computational complexity
0 references
linear programming
0 references
0 references
0.915046453475952
0 references
0.8650017976760864
0 references
0.8634276986122131
0 references
0.8434470891952515
0 references
0.8147478103637695
0 references
