Minimizing functions of infeasibilities in a two-machine flow shop

被引:0
|
作者
Lushchakova, IN [1 ]
机构
[1] Belarussian State Univ Informat & Radioelect, Minsk 220027, BELARUS
关键词
scheduling theory; complexity; flow shop; single machine;
D O I
10.1016/S0377-2217(99)00038-7
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a class of schedules obtained in the following way. In a schedule of processing n jobs in the two-machine flow shop we shift the jobs on the second machine backward in time to complete them by a deadline which is less than the optimal makespan. For the obtained schedule, the infeasibility of a job is defined as the length of the time interval for which the processing of this job on the first machine is not completed but its processing on the second machine has already started. A given function of the infeasibilities is to be minimized. We prove that the permutation version of this problem is equivalent to a single machine scheduling problem of minimizing an analogous function of tardiness. A number of complexity results for the nonpermutation version of this problem is also obtained. The permutation version of the problem under precedence constraints is investigated. As a side result, we find a new solvable case for the two-machine flow shop scheduling problem under precedence constraints to minimize makespan. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:380 / 393
页数:14
相关论文
共 50 条
  • [1] Minimizing tardiness in a two-machine flow-shop
    Pan, JCH
    Chen, JS
    Chao, CM
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) : 869 - 885
  • [2] Minimizing the total flow time and the tardiness in a two-machine flow shop
    Lee, WC
    Wu, CC
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2001, 32 (03) : 365 - 373
  • [3] Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
    Wang, Ji-Bo
    Ji, P.
    Cheng, T. C. E.
    Wang, Dan
    [J]. OPTIMIZATION LETTERS, 2012, 6 (07) : 1393 - 1409
  • [4] Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
    Ji-Bo Wang
    P. Ji
    T. C. E. Cheng
    Dan Wang
    [J]. Optimization Letters, 2012, 6 : 1393 - 1409
  • [5] Minimizing the weighted number of tardy jobs on a two-machine flow shop
    Bulfin, RL
    M'Hallah, R
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (12) : 1887 - 1900
  • [6] MIP models for minimizing total tardiness in a two-machine flow shop
    Kharbeche, M.
    Haouari, M.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (05) : 690 - 707
  • [7] Lower bounds for minimizing total completion time in a two-machine flow shop
    Hoogeveen, Han
    van Norden, Linda
    van de Velde, Steef
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (06) : 559 - 568
  • [8] Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown
    Faicel Hnaien
    Taha Arbaoui
    [J]. Annals of Operations Research, 2023, 328 : 1437 - 1460
  • [9] Lower bounds for minimizing total completion time in a two-machine flow shop
    Han Hoogeveen
    Linda van Norden
    Steef van de Velde
    [J]. Journal of Scheduling, 2006, 9 : 559 - 568
  • [10] Minimizing total completion time in a two-machine flow shop with deteriorating jobs
    Wang, Ji-Bo
    Ng, C. T. Daniel
    Cheng, T. C. E.
    Liu, Li-Li
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 180 (01) : 185 - 193