The complexity of two group scheduling problems (Q1860372): 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.1002/jos.118 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006725417 / rank | |||
Normal rank | |||
Revision as of 23:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of two group scheduling problems |
scientific article |
Statements
The complexity of two group scheduling problems (English)
0 references
23 February 2003
0 references
scheduling
0 references
group technology
0 references
parallel machines
0 references
open shop
0 references
