SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS

被引：29
|
作者：
JOZEFOWSKA, J
JURISCH, B
KUBIAK, W
机构：
[1] MEM UNIV NEWFOUNDLAND,FAC BUSINESS ADM,ST JOHNS,NF A1C 5S7,CANADA
[2] POZNAN TECH UNIV,INST COMP SCI,PL-60965 POZNAN,POLAND
来源：
OPERATIONS RESEARCH LETTERS | 1994年 / 16卷 / 05期
基金：
加拿大自然科学与工程研究理事会;
关键词：
OPEN SHOP; FLOW SHOP; JOB SHOP; NP-HARD; DYNAMIC PROGRAMMING;
D O I：
10.1016/0167-6377(94)90041-8
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The problem of scheduling jobs with a common due date d so that the weighted number of late jobs is minimized is considered for two machine open, flow, and job shop. NP-hardness proofs as well as optimization algorithms that run in time polynomial in d and the number of jobs are given for all three shop models.
引用
收藏
页码：277 / 283
页数：7
相关论文
共 50 条
  • [1] SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
    BRUCKER, P
    JURISCH, B
    TAUTENHAHN, T
    WERNER, F
    [J]. OPERATIONS RESEARCH LETTERS, 1993, 14 (05) : 245 - 250
  • [2] Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
    Lee, Wen-Chiung
    Lu, Zon-Syun
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (17) : 8750 - 8757
  • [3] Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
    Feng, Yifu
    Geng, Xin-Na
    Lv, Dan-Yang
    Wang, Ji-Bo
    [J]. OPTIMIZATION LETTERS, 2024, 18 (05) : 1217 - 1235
  • [4] Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
    Yifu Feng
    Xin-Na Geng
    Dan-Yang Lv
    Ji-Bo Wang
    [J]. Optimization Letters, 2024, 18 : 1217 - 1235
  • [5] Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs
    Chen, Rubing
    He, Ruyan
    Yuan, Jinjiang
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 167
  • [6] ALGORITHMS FOR SCHEDULING A SINGLE-MACHINE TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
    POTTS, CN
    VANWASSENHOVE, LN
    [J]. MANAGEMENT SCIENCE, 1988, 34 (07) : 843 - 858
  • [7] Batch scheduling to minimize the weighted number of tardy jobs
    Erel, Erdal
    Ghosh, Jay B.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (03) : 394 - 400
  • [8] Pareto-scheduling with double-weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
    Guo, Shuen
    Lu, Lingfa
    Yuan, Jinjiang
    Ng, Chi To
    Cheng, Tai Chiu Edwin
    [J]. NAVAL RESEARCH LOGISTICS, 2022, 69 (05) : 816 - 837
  • [9] Customer order scheduling to minimize the number of late jobs
    Lin, B. M. T.
    Kononov, A. V.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (02) : 944 - 948
  • [10] Open shop scheduling to minimize the number of late jobs
    Koulamas, C
    Kyparisis, GJ
    [J]. NAVAL RESEARCH LOGISTICS, 1998, 45 (05) : 525 - 532
12345