SINGLE FACILITY SCHEDULING WITH MULTIPLE JOB CLASSES

被引:18
|
作者
GUPTA, JND
机构
[1] Ball State Univ, Muncie, IN, USA, Ball State Univ, Muncie, IN, USA
关键词
D O I
10.1016/0377-2217(88)90252-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
6
引用
收藏
页码:42 / 45
页数:4
相关论文
共 50 条
  • [31] SINGLE FACILITY SCHEDULING WITH NONLINEAR PROCESSING TIMES
    GUPTA, JND
    GUPTA, SK
    COMPUTERS & INDUSTRIAL ENGINEERING, 1988, 14 (04) : 387 - 393
  • [32] MULTIPLE JOB SCHEDULING WITH ARTIFICIAL NEURAL NETWORKS
    LO, ZP
    BAVARIAN, B
    COMPUTERS & ELECTRICAL ENGINEERING, 1993, 19 (02) : 87 - 101
  • [33] MULTIPLE CRITERIA JOB-SHOP SCHEDULING
    DECKRO, RF
    HEBERT, JE
    WINKOFSKY, EP
    COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (04) : 279 - 285
  • [34] Scheduling of a Flexible Job Shop with Multiple Constraints
    Aschauer, A.
    Roetzer, F.
    Steinboeck, A.
    Kugi, A.
    IFAC PAPERSONLINE, 2018, 51 (11): : 1293 - 1298
  • [35] Multiple exchanges of job orders for no buffer job shop scheduling problem
    Hayasaka, Takehiro
    Hino, Rei
    Shamoto, Eiji
    Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 2013, 79 (806): : 3951 - 3964
  • [36] Minmax scheduling with job-classes and earliness-tardiness costs
    Mosheiov, Gur
    Oron, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (01) : 612 - 622
  • [37] Single machine scheduling with interfering job sets
    Khowala, Ketan
    Fowler, John
    Keha, Ahmet
    Balasubramanian, Hari
    COMPUTERS & OPERATIONS RESEARCH, 2014, 45 : 97 - 107
  • [38] HPC Scheduling Method Based on Debug and Background Job Classes Division
    A. V. Baranov
    Lobachevskii Journal of Mathematics, 2024, 45 (10) : 4899 - 4911
  • [39] Scheduling with job delivery coordination on single machine
    Dakui Jiang
    Jiayin Tan
    Optimization Letters, 2018, 12 : 265 - 272
  • [40] Scheduling with job delivery coordination on single machine
    Jiang, Dakui
    Tan, Jiayin
    OPTIMIZATION LETTERS, 2018, 12 (02) : 265 - 272