Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597): 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.1016/j.orl.2005.07.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987105744 / rank | |||
Normal rank | |||
Revision as of 21:04, 19 March 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
