Chi tiết| Tên | THE INVERSE PARALLEL MACHINE SCHEDULING PROBLEM WITH MINIMUM TOTAL COMPLETION TIME |
| Lĩnh vực | Toán học |
| Tác giả | Pham Hong Truong, Lu Xi Wen |
| Nhà xuất bản / Tạp chí | Journal of Industrial and Management Optimization (J IND MANAG OPTIM) (SCI) Tập 10 Số 2 Năm 2014 |
| Số hiệu ISSN/ISBN | 1547-5816 |
| Tóm tắt nội dung | |
In inverse scheduling problems, a job sequence is given and the objective is to determine the minimal perturbation to parameters, such as processing times or weights of jobs so that the given schedule becomes optimal with respect to a preselected objective function. In this paper we study the necessary and sucient conditions for optimality of the total completion time problem on parallel machines and inverse scheduling problem of the total completion time objective on parallel machines in which the processing times are minimally adjusted, so that a given target job sequence becomes an optimal schedule. Tải file THE INVERSE PARALLEL MACHINE SCHEDULING PROBLEM WITH MINIMUM TOTAL COMPLETION TIME tại đây |
|
