JOB LATENESS IN A 2-MACHINE FLOWSHOP WITH SETUP TIMES SEPARATED

被引：27
|
作者：
DILEEPAN, P [1 ]
SEN, T [1 ]
机构：
[1] UNIV TENNESSEE,SCH BUSINESS ADM,DEPT MANAGEMENT,615 MCCALLIE AVE,CHATTANOOGA,TN 37403
来源：
COMPUTERS & OPERATIONS RESEARCH | 1991年 / 18卷 / 06期
关键词：
D O I：
10.1016/0305-0548(91)90060-5
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper considers the two-machine flowshop problem of minimizing maximum lateness where setup times are separated from process times. Two sufficient conditions for optimality are presented. These conditions and a lower bound are used to develop a branch-and-bound solution procedure to arrive at an optimal solution. Computational results are also given. The computational results include comparison of the optimal solutions with the solutions obtained by two heuristic procedures based on the two sufficiency conditions mentioned earlier.
引用
收藏
页码：549 / 556
页数：8
相关论文
共 50 条
  • [31] 2-MACHINE ORDERED FLOWSHOP SCHEDULING UNDER RANDOM BREAKDOWNS
    ALLAHVERDI, A
    MITTENTHAL, J
    MATHEMATICAL AND COMPUTER MODELLING, 1994, 20 (02) : 9 - 17
  • [32] ANALYSIS OF HEURISTICS FOR 2-MACHINE FLOWSHOP SEQUENCING SUBJECT TO RELEASE DATES
    POTTS, CN
    MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (04) : 576 - 584
  • [33] Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
    Ben-Dati, Lika
    Mosheiov, Gur
    Oron, Daniel
    ADVANCES IN OPERATIONS RESEARCH, 2009, 2009
  • [34] A 2-MACHINE FLOWSHOP SEQUENCING PROBLEM WITH LIMITED WAITING TIME CONSTRAINTS
    YANG, DL
    CHERN, MS
    COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 28 (01) : 63 - 70
  • [35] A BRANCH-AND-BOUND APPROACH FOR A 2-MACHINE FLOWSHOP SCHEDULING PROBLEM
    NAGAR, A
    HERAGU, SS
    HADDOCK, J
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1995, 46 (06) : 721 - 734
  • [36] Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times
    Miguel A. González
    Camino R. Vela
    Inés González-Rodríguez
    Ramiro Varela
    Journal of Intelligent Manufacturing, 2013, 24 : 741 - 754
  • [37] Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times
    Gonzalez, Miguel A.
    Vela, Camino R.
    Gonzalez-Rodriguez, Ines
    Varela, Ramiro
    JOURNAL OF INTELLIGENT MANUFACTURING, 2013, 24 (04) : 741 - 754
  • [38] Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times
    Chang, JL
    Yan, WW
    Shao, HH
    PROCEEDINGS OF THE 2004 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2004, : 1412 - 1416
  • [39] Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
    Wang, Xiuli
    Cheng, T. C. Edwin
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (01) : 152 - 162
  • [40] One-operator-two-machine flowshop scheduling with setup and dismounting times
    Cheng, TCE
    Wang, G
    Sriskandarajah, C
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (07) : 715 - 730
12345