The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times

Computers & Mathematics with Applications - Tập 35 - Trang 95-100 - 1998
T.C.E. Cheng1
1Office of the Vice President (Research & Postgraduate Studies), The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China

Tài liệu tham khảo

Ho, 1993, Complexity of scheduling tasks with time dependent execution times, Information Processing Letters, 48, 315, 10.1016/0020-0190(93)90175-9 Cheng, 1996, The complexity of single machine scheduling with deadlines and identical decreasing rates of processing time, No, 05/96 Garey, 1979
Thông tin
Thông tin xuất bản

Computers & Mathematics with Applications

Tập 35

95-100

Thông tin tác giả