A note on the complexity of flow-shop scheduling with deteriorating jobs (Q629368): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.11.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151394285 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Time-dependent scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-hard cases in scheduling deteriorating jobs on dedicated machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4714493 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity analysis of job-shop scheduling with deteriorating jobs / rank | |||
Normal rank | |||
Latest revision as of 21:00, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of flow-shop scheduling with deteriorating jobs |
scientific article |
Statements
A note on the complexity of flow-shop scheduling with deteriorating jobs (English)
0 references
9 March 2011
0 references
deteriorating jobs
0 references
flow shop
0 references
makespan
0 references
NP-hardness
0 references
