ON SEQUENCING OF N JOBS ON ONE MACHINE TO MINIMIZE NUMBER OF JOBS LATE

被引：0
|
作者：
ELMAGHRA.SE [1 ]
机构：
[1] N CAROLINA STATE UNIV,RALEIGH,NC 27607
来源：
MANAGEMENT SCIENCE SERIES A-THEORY | 1972年 / 18卷 / 07期
关键词：
D O I：
10.1287/mnsc.18.7.389
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：389 / &
相关论文
共 50 条
  • [21] One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs
    Guner, E
    Erol, S
    Tani, K
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1998, 55 (02) : 213 - 219
  • [22] SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
    JOZEFOWSKA, J
    JURISCH, B
    KUBIAK, W
    OPERATIONS RESEARCH LETTERS, 1994, 16 (05) : 277 - 283
  • [23] A CRASH ANALYSIS OF SCHEDULING TO MINIMIZE THE NUMBER OF LATE JOBS
    FOULDS, LR
    TANG, GC
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1995, 12 (01) : 55 - 63
  • [24] Open shop scheduling to minimize the number of late jobs
    Koulamas, C
    Kyparisis, GJ
    NAVAL RESEARCH LOGISTICS, 1998, 45 (05) : 525 - 532
  • [25] Preemptive scheduling of jobs with tied parameters on a single processor to minimize the number of late jobs
    Vakhania, Nodari
    PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS: RECENT ADVANCES IN APPLIED MATHEMATICS, 2009, : 101 - +
  • [26] 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
    OPTIMIZATION LETTERS, 2024, 18 (05) : 1217 - 1235
  • [27] 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
    Optimization Letters, 2024, 18 : 1217 - 1235
  • [28] Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs
    H. A. J. Crauwels
    C. N. Potts
    D. Van Oudheusden
    L. N. Van Wassenhove
    Journal of Scheduling, 2005, 8 : 161 - 177
  • [29] A branch and bound to minimize the number of late jobs on a single machine with release time constraints
    Baptiste, Philippe
    Peridy, Laurent
    Pinson, Eric
    European Journal of Operational Research, 2003, 144 (01): : 1 - 11
  • [30] A branch and bound to minimize the number of late jobs on a single machine with release time constraints
    Baptiste, P
    Peridy, L
    Pinson, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) : 1 - 11
12345