A Note On The Complexity Of Openshop Scheduling Problems (Q3142313): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1080/03155986.1991.11732176 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W95437694 / rank | |||
Normal rank | |||
Latest revision as of 01:14, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Note On The Complexity Of Openshop Scheduling Problems |
scientific article |
Statements
A Note On The Complexity Of Openshop Scheduling Problems (English)
0 references
15 November 1993
0 references
finish time
0 references
total weighted tardiness
0 references
maximum lateness
0 references
openshop scheduling
0 references
mean flow time in no-wait openshop
0 references
number of late jobs
0 references
preemptive schedules
0 references
NP-hard
0 references
