A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness (Q2770081)
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 graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness |
scientific article; zbMATH DE number 1702793
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness |
scientific article; zbMATH DE number 1702793 |
Statements
7 February 2002
0 references
weighted tardiness job-shop scheduling
0 references
random shop disturbances
0 references
decomposition method
0 references
scheduling decisions
0 references
branch-and-bound algorithm
0 references
A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness (English)
0 references
