Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:42, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three is easy, two is hard: Open shop sum-batch scheduling problem refined |
scientific article |
Statements
Three is easy, two is hard: Open shop sum-batch scheduling problem refined (English)
0 references
15 January 2008
0 references
scheduling
0 references
open shop
0 references
batching
0 references
polynomial-time algorithm
0 references
