Complexity results for flow-shop problems with a single server

被引：27
作者：
Brucker, P
Knust, S
Wang, GQ
机构：
[1] Univ Osnabruck, Fachbereich Math Informat, D-49069 Osnabruck, Germany
[2] Jinan Univ, Dept Business Adm, Guangzhou, Peoples R China
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2005年 / 165卷 / 02期
关键词：
complexity results; flow-shop; setup times; single server;
D O I：
10.1016/j.ejor.2004.04.010
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
Flow-shop problems with a single server are generalizations of classical flow-shop problems. Immediately before processing, each operation must be loaded onto the corresponding machine, which takes a certain setup time. These setup times are assumed to be separable from the processing times, i.e. a setup on a subsequent machine may be performed while the job is still processed on the preceding machine. All setups have to be done by a single server which can perform at most one setup at a time. New complexity results are derived for special cases. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：398 / 407
页数：10
相关论文
共 15 条
  • [1] A review of scheduling research involving setup considerations
    Allahverdi, A
    Gupta, JND
    Aldowaisan, T
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (02): : 219 - 239
  • [2] Baptiste P., 1999, Journal of Scheduling, V2, P245, DOI 10.1002/(SICI)1099-1425(199911/12)2:6<245::AID-JOS28>3.0.CO
  • [3] 2-5
  • [4] Scheduling equal-length jobs on identical parallel machines
    Baptiste, P
    [J]. DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 21 - 32
  • [5] Complexity results for parallel machine problems with a single server
    Brucker, P
    Dhaenens-Flipo, C
    Knust, S
    Kravchenko, SA
    Werner, F
    [J]. JOURNAL OF SCHEDULING, 2002, 5 (06) : 429 - 457
  • [6] Cheng TCE, 1999, COMPUT OPER RES, V26, P715, DOI 10.1016/S0305-0548(98)00087-2
  • [7] Cheng TCE, 2000, PROD OPER MANAG, V9, P262, DOI 10.1111/j.1937-5956.2000.tb00137.x
  • [8] Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
  • [9] Glass CA, 2000, NAV RES LOG, V47, P304, DOI 10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO
  • [10] 2-1
12