The problem of scheduling jobs with diferent release dates or same release dates on parallel identical unbounded batch processing machines to minimize several scheduling criteria is considered. Pseudo-polynomial time dynamic programming algorithm, or fully polynomial time approximation scheme is developed for the scheduling problem under consideration, respectively.
【基金】
上海市教委科研创新项目(No.12YZ178)资助
【更新日期】
2014-01-07
【分类号】
O223
【正文快照】
0 IntroductionWe explore the problem of scheduling jobs with diferent release dates on parallel identical unboundedbatch processing machines which is motivated by the burn-in operations in the final testing stage of semi-conductor manufacturing.This model