Job shop scheduling with deadlines

被引：15
|
作者：
Balas, E [1 ]
Lancia, G
Serafini, P
Vazacopoulos, A
机构：
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
[2] Univ Udine, I-33100 Udine, Italy
[3] Fairleigh Dickinson Univ, Teaneck, NJ USA
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 1998年 / 1卷 / 04期
基金：
美国国家科学基金会;
关键词：
scheduling; deadlines; shifting bottleneck;
D O I：
10.1023/A:1009750409895
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper we deal with a variant of the Job Shop Scheduling Problem. We consider the addition of release dates and deadlines to be met by all jobs. The objective is makespan minimization if there are no tardy jobs, and tardiness minimization otherwise. The problem is approached by using a Shifting Bottleneck strategy. The presence of deadlines motivates an iterative use of a particular one machine problem which is solved optimally. The overall procedure is heuristic and exhibits a good trade-off between computing time and solution quality.
引用
收藏
页码：329 / 353
页数：25
相关论文
共 50 条
  • [41] Interval job shop scheduling problems
    Lei, Deming
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 60 (1-4): : 291 - 301
  • [42] SCHEDULING THE GENERAL JOB-SHOP
    BARKER, JR
    MCMAHON, GB
    [J]. MANAGEMENT SCIENCE, 1985, 31 (05) : 594 - 598
  • [43] On cyclic job shop scheduling problem
    Bozejko, Wojciech
    Wodecki, Mieczyslaw
    [J]. 2018 IEEE 22ND INTERNATIONAL CONFERENCE ON INTELLIGENT ENGINEERING SYSTEMS (INES 2018), 2018, : 265 - 270
  • [44] ON THE JOB-SHOP SCHEDULING PROBLEM
    MANNE, AS
    [J]. OPERATIONS RESEARCH, 1960, 8 (02) : 219 - 223
  • [45] Flexible job shop scheduling with blockages
    R. S. Hansmann
    T. Rieger
    U. T. Zimmermann
    [J]. Mathematical Methods of Operations Research, 2014, 79 : 135 - 161
  • [46] Mining scheduling knowledge for job shop scheduling problem
    Wang, C. L.
    Rong, G.
    Weng, W.
    Feng, Y. P.
    [J]. IFAC PAPERSONLINE, 2015, 48 (03): : 800 - 805
  • [47] Online Job Dispatching and Scheduling to Minimize Job Completion Time and to Meet Deadlines
    Li, Yupeng
    [J]. JOURNAL OF INTERCONNECTION NETWORKS, 2018, 18 (04)
  • [48] Mathematical Models of Flow Shop and Job Shop Scheduling Problems
    Seda, Milos
    [J]. PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 : 122 - 127
  • [49] Automated scheduling by families. Part II: job shop and flow shop scheduling
    Galvin, Thomas M.
    [J]. Production and Inventory Management Journal, 36 (04): : 38 - 45
  • [50] Flexible job-shop scheduling with release dates, deadlines and sequence dependent setup times: a real-world case
    Winklehner, Philipp
    Hauder, Viktoria A.
    [J]. 3RD INTERNATIONAL CONFERENCE ON INDUSTRY 4.0 AND SMART MANUFACTURING, 2022, 200 : 1654 - 1663
12345