The time dependent machine makespan problem is strongly NP-complete

Computers & Operations Research - Tập 26 - Trang 749-754 - 1999
T.C.E. Cheng1, Q. Ding2
1Office of the Vice-President (Research & Postgraduate Studies), The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
2Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

Thông tin
Thông tin xuất bản

Computers & Operations Research

Tập 26

749-754

Thông tin tác giả