An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2013.12.127 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2013.12.127 / rank | |||
Normal rank | |||
Latest revision as of 00:35, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times |
scientific article |
Statements
An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (English)
0 references
21 June 2018
0 references
scheduling
0 references
open shop
0 references
quadratic completion time
0 references
Lagrangian relaxation
0 references
dynamic programming
0 references
optimal property
0 references
0 references
0 references
0 references
