Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

被引:16
|
作者
Ji, Min [1 ,2 ]
Cheng, T. C. E. [1 ]
机构
[1] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
[2] Zhejiang Gongshang Univ, Sch Comp Sci & Informat Engn, Hangzhou 310018, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Availability constraint; 0-1 integer programming; Computational complexity; FPTAS; DEPENDENT PROCESSING TIMES;
D O I
10.1016/j.cie.2010.08.005
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0-1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:794 / 798
页数:5
相关论文
共 50 条
  • [1] Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
    Wu, CC
    Lee, WC
    [J]. INFORMATION PROCESSING LETTERS, 2003, 87 (02) : 89 - 93
  • [2] Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
    Ji, Min
    Cheng, T. C. E.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) : 90 - 98
  • [3] Scheduling deteriorating jobs to minimize the makespan on a single machine
    Chin-Chia Wu
    Yau-Ren Shiau
    Ling-Huei Lee
    Wen-Chiung Lee
    [J]. The International Journal of Advanced Manufacturing Technology, 2009, 44 : 1230 - 1236
  • [4] Scheduling deteriorating jobs to minimize the makespan on a single machine
    Wu, Chin-Chia
    Shiau, Yau-Ren
    Lee, Ling-Huei
    Lee, Wen-Chiung
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 44 (11-12): : 1230 - 1236
  • [5] Scheduling linear deteriorating jobs with an availability constraint on a single machine
    Ji, Min
    He, Yong
    Cheng, T. C. E.
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 362 (1-3) : 115 - 126
  • [6] Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan
    Zhao, Chuanli
    Tang, Hengyong
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2016, 33 (06)
  • [7] Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
    Fan, Baoqiang
    Li, Shisheng
    Zhou, Li
    Zhang, Liqi
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 275 - 280
  • [8] Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
    Wang, Xiuli
    Cheng, T. C. Edwin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (01) : 57 - 70
  • [9] Scheduling deteriorating jobs to minimize makespan
    Kubiak, W
    van de Velde, S
    [J]. NAVAL RESEARCH LOGISTICS, 1998, 45 (05) : 511 - 523
  • [10] Scheduling Piecewise Linear Deteriorating Jobs to Minimize Makespan in a Two-Machine Flowshop
    Jafari-Nodoushan A.
    Zare H.K.
    Lotfi M.M.
    Tavakkoli-Moghaddam R.
    [J]. Operations Research Forum, 2 (4)