A survey of scheduling problems with late work criteria

被引:96
作者
Sterna, Malgorzata [1 ]
机构
[1] Poznan Univ Tech, Inst Comp Sci, PL-60965 Poznan, Poland
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2011年 / 39卷 / 02期
关键词
Scheduling; Late work; Single machine; Parallel machines; Dedicated machines; WEIGHTED LATE WORK; 2-MACHINE FLOW-SHOP; SINGLE-MACHINE; JOB-SHOP; IMPRECISE COMPUTATIONS; APPROXIMATION SCHEME; MINIMIZE; ALGORITHMS; NUMBER;
D O I
10.1016/j.omega.2010.06.006
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The paper presents the first complete survey of scheduling problems with the late work criteria. Late work objective functions estimate the quality of a schedule based on durations of late parts of jobs, not taking into account the amount of delay for fully late jobs. The paper provides a formal definition of the late work parameter and compares the criteria based on it with other classical performance measures. It shows the relationship between the late work model and the imprecise computation model known from the hard real-time literature. Moreover, the paper presents a few real world applications of the late work objective function. The paper lists results obtained for nearly forty problems of scheduling jobs on a single machine, parallel (identical and uniform) machines and dedicated machines, investigated in the literature since 1984. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:120 / 129
页数:10
相关论文
共 73 条
  • [31] PREEMPTIVE SCHEDULING OF UNIFORM PROCESSOR SYSTEMS
    GONZALEZ, T
    SAHNI, S
    [J]. JOURNAL OF THE ACM, 1978, 25 (01) : 92 - 101
  • [32] Batching for work and rework processes on dedicated facilities to minimize the makespan
    Gribkovskaia, Irina V.
    Kovaley, Sergey
    Werner, Frank
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2010, 38 (06): : 522 - 527
  • [33] FAST ALGORITHMS FOR BIPARTITE NETWORK FLOW
    GUSFIELD, D
    MARTEL, C
    FERNANDEZBACA, D
    [J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (02) : 237 - 251
  • [34] Hariri A. M. A., 1995, ORSA Journal on Computing, V7, P232, DOI 10.1287/ijoc.7.2.232
  • [35] MINIMIZING THE NUMBER OF TARDY JOB UNITS UNDER RELEASE TIME CONSTRAINTS
    HOCHBAUM, DS
    SHAMIR, R
    [J]. DISCRETE APPLIED MATHEMATICS, 1990, 28 (01) : 45 - 57
  • [36] STRONGLY POLYNOMIAL ALGORITHMS FOR THE HIGH MULTIPLICITY SCHEDULING PROBLEM
    HOCHBAUM, DS
    SHAMIR, R
    [J]. OPERATIONS RESEARCH, 1991, 39 (04) : 648 - 653
  • [37] Jackson J.R., 1956, Naval Research Logistics Quarterly, V3, P201
  • [38] A note on a makespan minimization problem with a multi-ability learning effect
    Janiak, Adam
    Rudek, Radoslaw
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2010, 38 (3-4): : 213 - 217
  • [39] Johnson S.M., 1954, Nav. Res. Logist. Q, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
  • [40] SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
    JOZEFOWSKA, J
    JURISCH, B
    KUBIAK, W
    [J]. OPERATIONS RESEARCH LETTERS, 1994, 16 (05) : 277 - 283