期刊文献+

机器具有不可用时间间隔的两机无等待流水车间调度问题的求解性质

Properties of solving two-machine no-wait flow shop scheduling with an unavailable interval
原文传递
导出
摘要 研究工件具有无等待约束,并且只有一台机器具有不可用时间间隔的两机流水车间调度问题.文中给出使用GGA算法得到问题最优解的条件,并证明问题的复杂性,分析将GGA算法作为问题启发式算法的最坏性能比范围. In this paper, the two-machine no-wait flow shop scheduling problem with an unavaila-ble interval is studied. The optimality conditions of solving the problem by the GGA algorithm are presented. The complexity of the problem is proved. The worst - case performance ratio of the GGA algorithm as a heuristic is analyzed.
作者 陈可嘉 王潇
出处 《福州大学学报(自然科学版)》 CAS CSCD 北大核心 2014年第2期265-269,共5页 Journal of Fuzhou University(Natural Science Edition)
基金 国家自然科学基金资助项目(70901021 71201033) 教育部新世纪优秀人才支持计划资助项目(NCET-11-0903)
关键词 两机流水车间调度 不可用时间间隔 无等待 GGA算法性 最坏性能比 two - machine flow shop scheduling unavailable interval no - wait GGA worst - caseperformance ratio
  • 引文网络
  • 相关文献

参考文献10

  • 1Johnson S M. Optimal two - and three - stage production schedules with setup times included [ J ]. Naval Research Logistics Quarterly, 1954, 1(1) : 61 -68.
  • 2Gilmore P C, Gomory R E. Sequencing a one - state variable machine: A solvable case of the traveling salesman problem[ J]. Operations Research, 1964, 12(5) : 655 - 679.
  • 3Dileepan P. A note on minimizing maximum lateness in a two - machine no - wait flowshop [ J ]. Computers & Operations Re- search, 2004, 31(12) : 2 111 -2 115.
  • 4常俊林,邵惠鹤.两机零等待流水车间调度问题的启发式算法[J].计算机集成制造系统,2005,11(8):1147-1153. 被引量:9
  • 5Su L H, Lee Y Y. The two - machine flowshop no - wait scheduling problem with a single server to minimize the total comple- tion time[J]. Computers and Operations Research, 2008, 35(9) : 2 952 -2 963.
  • 6Wang Guo -qing, Cheng T C E. Heuristics for two -machine no -wait flowshop scheduling with an availability constraint[J]. Information Processing Letters, 2001, 80(6): 305-309.
  • 7Cheng T C E, Liu Zhao -hui. Approximability of two -machine no -wait flowshop scheduling with availability constraints[ J]. Operations Research Letters, 2003, 31 (4) : 319- 322.
  • 8Cheng T C E, Liu Z H. 3/2 - approximation for two - machine no - wait flowshop scheduling with availability constraints [ J ]. Information Processing Letters, 2003, 88(4) : 161 -165.
  • 9Kubzin M A, Strusevich V A. Two - machine flow shop no - wait scheduling with a nonavailability interval[ J]. Naval Research Logistics. 2004. 51(4) : 613 -631.
  • 10Chihaoui F B, Kacem I, Hadj - Alouane A B. No - wait scheduling of a two - machine flow - shop to minimize the makespan under non - availability constraints and different release dates [ J ]. International Journal of Production Research, 2011, 49 (21) : 6273 -6286.

二级参考文献10

  • 1BERTOLISSI E. Heuristic algorithm for scheduling in the no -wait flowshop[J]. Journal of Material Processing Technology, 2000, 107(1-3): 459-465.
  • 2HALL N, SRISKANDARAJAH C. A survey of machine scheduling problems with blocking and no- wait in process[J]. Operations Research, 1996, 44(3): 510-525.
  • 3ALLAHVERDI T, GUPTA J, ALDOWAISAN T. A review of scheduling research involving setup considerations[J]. OMEGA The International Journal of Management Sciences,1999, 27(2): 219-239.
  • 4SRISKANDARAJAH C, LADET P. Some no-wait shops scheduling problems: complexity aspect[J]. European Journal of Operational Research, 1986, 24(3): 424-445.
  • 5GUPTA J, STRUSEVICH V, ZWANEVELDC. Two-stage no- wait scheduling models with setup and removal times [J].Computers and Operations Research, 1997, 24(11): 1025-1031.
  • 6GUPTA J, TUNC E. Scheduling a two-stage hybrid flowshop with separable setup and removal times[J]. European Journal of Operational Research, 1994, 77(3) : 415-426.
  • 7ALLAHVERDI A, ALDOWAISAN T. No-wait and separate setup three-machine flowshop with total completion time criterion [J]. International Transactions In Operational Research, 2000, 7(3): 245-264.
  • 8ALDOWAISAN T, ALLAHVERDI A. Total flowtime in no -wait flowshops with separated setup times[J]. Computers and Operations Research, 1998, 25(9): 1025-1031.
  • 9ALDOWAISAN T. A new heuristic and dominance relations for no-wait flowshops with setup times[J]. Computers and Operations Research, 2001, 28(6): 563-584.
  • 10SETHANAN K. Scheduling flexible flowshops with sequence dependent setup times[D]. Morgantown WV, USA: West Virginia University, 2001.

共引文献8

相关主题

;
使用帮助 返回顶部