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 条
  • [1] Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates
    T.C. Edwin Cheng
    Natalia V. Shakhlevich
    [J]. Journal of Global Optimization, 2003, 27 : 293 - 311
  • [2] No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
    Brauner, Nadia
    Kovalyov, Mikhail Y.
    Quilliot, Alain
    Toussaint, Helene
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 132
  • [3] Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
    Verma, S
    Dessouky, M
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) : 930 - 943
  • [4] No-idle Parallel Machine Scheduling of Unit-time Jobs
    Brauner, Nadia
    Kovalyov, Mikhail Y.
    Quilliot, Alain
    Toussaint, Helene
    [J]. 2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019), 2019, : 807 - 811
  • [5] Uniform machine scheduling of unit-time jobs subject to resource constraints
    Kovalyov, MY
    Shafransky, YM
    [J]. DISCRETE APPLIED MATHEMATICS, 1998, 84 (1-3) : 253 - 257
  • [6] MULTIPROCESSOR SCHEDULING OF UNIT-TIME JOBS WITH ARBITRARY RELEASE TIMES AND DEADLINES
    SIMONS, B
    [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (02) : 294 - 299
  • [7] AN NC ALGORITHM FOR SCHEDULING UNIT-TIME JOBS WITH ARBITRARY RELEASE TIMES AND DEADLINES
    FREDERICKSON, GN
    RODGER, SH
    [J]. SIAM JOURNAL ON COMPUTING, 1994, 23 (01) : 185 - 211
  • [8] SCHEDULING UNIT-TIME JOBS ON PROCESSORS WITH DIFFERENT CAPABILITIES
    CHEN, YL
    CHIN, YH
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (05) : 409 - 417
  • [9] Single machine group scheduling problem with deteriorating jobs and release dates
    Liu, Lu
    Xu, Yang-Tao
    Yin, Na
    Wang, Ji-Bo
    [J]. APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 : 2145 - 2148
  • [10] Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
    Mitre Costa Dourado
    Rosiane de Freitas Rodrigues
    Jayme Luiz Szwarcfiter
    [J]. Annals of Operations Research, 2009, 169 : 81 - 91
12345