Single machine scheduling of unit-time jobs with controllable release dates

被引：9
|
作者：
Cheng, TCE [1 ]
Shakhlevich, NV
机构：
[1] Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China
[2] Natl Acad Sci, Minsk 220012, BELARUS
来源：
JOURNAL OF GLOBAL OPTIMIZATION | 2003年 / 27卷 / 2-3期
关键词：
scheduling; deterministic; single machine; controllable release dates; multiple criteria;
D O I：
10.1023/A:1024826720369
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The paper presents a bicriterion approach to solve the single-machine scheduling problem in which the job release dates can be compressed while incurring additional costs. The two criteria are the makespan and the compression cost. For the case of equal job processing times, an O(n(4)) algorithm is developed to construct integer Pareto optimal points. We discuss how the algorithm developed can be modified to construct an epsilon-approximation of noninteger Pareto optimal points. The complexity status of the problem with total weighted completion time criterion is also established.
引用
收藏
页码：293 / 311
页数：19
相关论文
共 50 条
  • [21] A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
    Xu, Kailiang
    Feng, Zuren
    Ke, Liangjun
    ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) : 303 - 324
  • [22] Single machine scheduling with release dates and rejection
    Zhang, Liqi
    Lu, Lingfa
    Yuan, Jinjiang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (03) : 975 - 978
  • [23] Two scheduling problems of two agents' jobs with unit processing time and different release dates
    Ding, Guosheng
    Fang, Zhizhou
    Yang, Hui
    INFORMATION TECHNOLOGY AND INDUSTRIAL ENGINEERING, VOLS 1 & 2, 2014, : 137 - 143
  • [24] Soft due window assignment and scheduling of unit-time jobs on parallel machines
    Adam Janiak
    Wladyslaw Janiak
    Mikhail Y. Kovalyov
    Frank Werner
    4OR, 2012, 10 : 347 - 360
  • [25] SCHEDULING UNIT-TIME TASKS WITH INTEGER RELEASE TIMES AND DEADLINES
    FREDERICKSON, GN
    INFORMATION PROCESSING LETTERS, 1983, 16 (04) : 171 - 173
  • [26] Soft due window assignment and scheduling of unit-time jobs on parallel machines
    Janiak, Adam
    Janiak, Wladyslaw
    Kovalyov, Mikhail Y.
    Werner, Frank
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (04): : 347 - 360
  • [27] Two-agent scheduling with linear-deteriorating jobs and release dates on a single machine
    Zhao, Xiao-Li
    Tang, Li-Xin
    Zidonghua Xuebao/Acta Automatica Sinica, 2015, 41 (01): : 104 - 112
  • [28] Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
    Kravchenko, SA
    DISCRETE APPLIED MATHEMATICS, 2000, 98 (03) : 209 - 217
  • [29] MINIMUM NUMBER OF TARDY JOBS IN SINGLE-MACHINE SCHEDULING WITH RELEASE DATES - AN IMPROVED ALGORITHM
    JOHN, TC
    WU, YB
    COMPUTERS & INDUSTRIAL ENGINEERING, 1987, 12 (03) : 223 - 230
  • [30] Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs
    Janiak, A.
    Janiak, W. A.
    Januszkiewicz, R.
    BULLETIN OF THE POLISH ACADEMY OF SCIENCES-TECHNICAL SCIENCES, 2009, 57 (03) : 209 - 215
12345