Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times

被引：17
|
作者：
Fondrevelle, J. [1 ,2 ]
Oulamara, A. [2 ]
Portmann, M. -C. [2 ]
机构：
[1] Inst Natl Sci Appl, LIESP Lab, F-69621 Villeurbanne, France
[2] INPL, MACSI Team, LORIA INRIA Lorraine, F-54042 Nancy, France
来源：
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2008年 / 112卷 / 01期
关键词：
flowshop; weighted sum of machine completion times; idle time; minimal and maximal time lags; branch-and-bound procedure;
D O I：
10.1016/j.ijpe.2006.08.018
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial applications. The objective is to minimize a non-classical criterion based on the weighted sum of machine completion times. We show that it generalizes makespan and we derive several complexity results for two- and three-machine problems. An exact algorithm based on a branch-and-bound procedure is developed to solve the permutation flowshop problem with in machines. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：168 / 176
页数：9
相关论文
共 50 条
  • [1] Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
    Cheng, T. C. E.
    Lin, B. M. T.
    Tian, Y.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) : 3031 - 3040
  • [2] Scheduling to minimize the weighted sum of completion times
    Zhao, Chuan-Li
    Zhang, Qing-Ling
    Tang, Heng-Yong
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2003, 24 (06): : 515 - 518
  • [3] Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
    Chekuri, C
    Motwani, R
    [J]. DISCRETE APPLIED MATHEMATICS, 1999, 98 (1-2) : 29 - 38
  • [4] Permutation flowshop scheduling problems with maximal and minimal time lags
    Fondrevelle, J
    Oulamara, A
    Portmann, MC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (06) : 1540 - 1556
  • [5] A flowshop scheduling algorithm to minimize total weighted completion time
    Zhao, CL
    Zhang, QL
    Tang, HY
    [J]. PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 1485 - 1488
  • [6] Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
    Kacem, Imed
    Chu, Chengbin
    Souissi, Ahmed
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) : 827 - 844
  • [7] SCHEDULING TO MINIMIZE WEIGHTED SUM OF COMPLETION TIMES WITH SECONDARY CRITERIA
    BURNS, RN
    [J]. NAVAL RESEARCH LOGISTICS, 1976, 23 (01) : 125 - 129
  • [8] FLOWSHOP NO-IDLE OR NO-WAIT SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES
    ADIRI, I
    POHORYLES, D
    [J]. NAVAL RESEARCH LOGISTICS, 1982, 29 (03) : 495 - 504
  • [9] Parallel machine scheduling to minimize the sum of quadratic completion times
    Cheng, TCE
    Liu, ZH
    [J]. IIE TRANSACTIONS, 2004, 36 (01) : 11 - 17
  • [10] Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times
    He, Yong
    Sun, Li
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
12345