Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan

被引：25
|
作者：
Wang, Ji-Bo [1 ]
机构：
[1] Shenyang Inst Aeronaut Engn, Sch Sci, Shenyang 110136, Peoples R China
来源：
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2010年 / 48卷 / 5-8期
关键词：
Scheduling; Flow shop; Simple linear deterioration; Makespan; Dominating machines; DEPENDENT PROCESSING TIMES; LINEAR DETERIORATION; COMPLETION-TIME; SINGLE-MACHINE;
D O I：
10.1007/s00170-009-2314-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider an n-job, m-machine flow shop scheduling problem with deteriorating jobs. By deteriorating jobs, we mean jobs whose processing times are an increasing function of their execution starting time. A simple linear deterioration function is assumed. When some dominant relationships between m-1 machines can be satisfied, we show that the makespan minimization problem can be solved in polynomial time.
引用
收藏
页码：719 / 723
页数：5
相关论文
共 50 条
  • [21] MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
    Wang, Ji-Bo
    Wang, Ming-Zheng
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2013, 30 (06)
  • [22] SCHEDULING JOBS WITH RELEASE DATES AND TAILS ON IDENTICAL MACHINES TO MINIMIZE THE MAKESPAN
    CARLIER, J
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 29 (03) : 298 - 306
  • [23] Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
    Mazdeh, Mohammad Mahdavi
    Zaerpour, Farzad
    Zareei, Abalfazl
    Hajinezhad, Ali
    [J]. APPLIED MATHEMATICAL MODELLING, 2010, 34 (06) : 1498 - 1510
  • [24] Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan
    Allaoui, H.
    Lamouri, S.
    Artiba, A.
    Aghezzaf, E.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 112 (01) : 161 - 167
  • [25] Scheduling parallel jobs to minimize the makespan
    Johannes, Berit
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (05) : 433 - 452
  • [26] Scheduling parallel jobs to minimize the makespan
    Berit Johannes
    [J]. Journal of Scheduling, 2006, 9 : 433 - 452
  • [27] Scheduling Piecewise Linear Deteriorating Jobs to Minimize Makespan in a Two-Machine Flowshop
    Jafari-Nodoushan A.
    Zare H.K.
    Lotfi M.M.
    Tavakkoli-Moghaddam R.
    [J]. Operations Research Forum, 2 (4)
  • [28] Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan
    Wang, Chia-Nan
    Hsu, Hsien-Pin
    Fu, Hsin-Pin
    Nguyen Ky Phuc Phan
    Van Thanh Nguyen
    [J]. COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2022, 40 (01): : 17 - 36
  • [29] Flow-shop scheduling with exact delays to minimize makespan
    Khatami, Mostafa
    Salehipour, Amir
    Cheng, T. C. E.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 183
  • [30] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    L. L. Liu
    C. T. Ng
    T. C. E. Cheng
    [J]. Optimization Letters, 2014, 8 : 307 - 318
12345