On the complexity of two-machine flowshop problems with due date related objectives |
| |
| Institution: | 1. Department of Statistics, Feng Chia University, Taichung 40724, Taiwan;2. Business Administration Department, Fujen Catholic University, Hsinpei City, Taiwan |
| |
| Abstract: | The complexity of two-machine flowshop problems with due date related criteria is investigated. It is shown that when certain restrictions are imposed on the job processing times and their due dates these problems become polynomially solvable while when these restrictions are slightly weakened the problems remain NP-complete. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
