A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness (Q2770081): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Robert H. Storer / rank | |||
| Property / author | |||
| Property / author: Robert H. Storer / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: JOBSHOP / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.47.1.113 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138898223 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness |
scientific article |
Statements
A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness (English)
0 references
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
