- Research Article
3
- 10.1080/10170669.1998.10432956
A heuristic solution to the total tardiness and earliness penalties of an m-machine nonpreemptive open-shop schedule
- Mar 01, 1998
- Journal of the Chinese Institute of Industrial Engineers
- Hsueh-Foo Lin
An open-shop schedule has no restrictions on the processing order of the jobs. The problem of minimizing the total earliness and tardiness penalties in an m-machine nonpreemptive open-shop is NP-hard. A network structure based on the spanning tree is constructed in this work to simplify the mathematical model of a nonpreemptive open-shop problem whose objective is to minimize total earliness and tardiness penalties. The idle time rule developed in this work serves as the decision criterion in testing the performance. The proposed heuristic is compared with SPT, EDD, SLACK, and MWSTR/EST methods using 7,200 cases which are constructed by different features. Expenmental results mdlcate that the proposed heuristic performs much better than the other four methods under the total tardiness and earliness penalties criterion.
Read more