We consider the scheduling problem of minimizing the makespan on a single machine with step-improving job processing times around a common critical date. For this problem we give an NP-hardness proof, a fast pseudo-polynomial time algorithm, an FPTAS, and an on-line algorithm with best possible competitive ratio. (c) 2005 Elsevier B.V. All rights reserved.
机构:
Hong Kong Polytech Univ, PolyU Business Sch, Hung Hom, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, PolyU Business Sch, Hung Hom, Kowloon, Hong Kong, Peoples R China
Cheng, T. C. E.
Kravchenko, Svetlana A.
论文数: 0引用数: 0
h-index: 0
机构:
ArasCorp Dev Ctr, Minsk, BELARUSHong Kong Polytech Univ, PolyU Business Sch, Hung Hom, Kowloon, Hong Kong, Peoples R China
Kravchenko, Svetlana A.
Lin, Bertrand M. T.
论文数: 0引用数: 0
h-index: 0
机构:
Natl Yang Ming Chiao Tung Univ, Inst Informat Management, Hsinchu, TaiwanHong Kong Polytech Univ, PolyU Business Sch, Hung Hom, Kowloon, Hong Kong, Peoples R China
机构:
Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China
Cheng, TCE
Ding, Q
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R ChinaHong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China
机构:
Natl Chi Nan Univ, Dept Informat Management, Puli 545, Nan Tou County, TaiwanNatl Chi Nan Univ, Dept Informat Management, Puli 545, Nan Tou County, Taiwan
Jeng, AAK
Lin, BMT
论文数: 0引用数: 0
h-index: 0
机构:
Natl Chi Nan Univ, Dept Informat Management, Puli 545, Nan Tou County, TaiwanNatl Chi Nan Univ, Dept Informat Management, Puli 545, Nan Tou County, Taiwan