An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
2014
Abstract This paper addresses an open-shop scheduling problem with the objective of minimising the total quadratic completion time. A solution approach based on Lagrangian relaxation is presented to handle small-scale problems. Additionally, optimal properties are determined for two special cases of this problem. Finally, numerous experiments demonstrate the effectiveness of the Lagrangian relaxation method.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
14
References
6
Citations
NaN
KQI