標題: Scheduling time-dependent jobs under mixed deterioration
作者: Gawiejnowicz, Stanislaw
Lin, Bertrand M. T.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: Scheduling;Single machine;Deteriorating jobs;Polynomial-time algorithms;NP-hard problems
公開日期: 15-三月-2010
摘要: We consider a new model of time-dependent scheduling. A set of deteriorating jobs has to be processed on a single machine which is available starting from a non-zero time. The processing times of some jobs from this set are constant, while other ones are either proportional or linear functions of the job starting times. The applied criteria of schedule optimality include the maximum completion time, the total completion time, the total weighted completion time, the maximum lateness and the number of tardy jobs. We delineate a sharp boundary between computationally easy and difficult problems, showing polynomially solvable and NP-hard cases. (C) 2010 Elsevier Inc. All rights reserved.
URI: http://dx.doi.org/10.1016/j.amc.2010.01.037
http://hdl.handle.net/11536/5718
ISSN: 0096-3003
DOI: 10.1016/j.amc.2010.01.037
期刊: APPLIED MATHEMATICS AND COMPUTATION
Volume: 216
Issue: 2
起始頁: 438
結束頁: 447
顯示於類別:期刊論文


文件中的檔案:

  1. 000275739000011.pdf