| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7541877 | Computers & Industrial Engineering | 2017 | 55 Pages |
Abstract
To the best of our knowledge, no prior research has thoroughly addressed this scheduling problem. Three methods based on the mixed integer programming (MIP), namely, the hard-constraint mixed integer programming (HCMIP), the earliness-tardiness mixed integer programming (ETMIP), and the three-phase heuristics-initialized mixed integer programming (HIMIP), are proposed and tested. The experiment results show that HIMIP is the most effective in solving the problem.
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
Yi-Feng Hung, Jian-Song Bao, Yu-En Cheng,