Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4628139 | Applied Mathematics and Computation | 2014 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhi-Hai Zhang, Danyu Bai,