期刊文献+

A hybrid two-stage fexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately 被引量:1

A hybrid two-stage fexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
下载PDF
导出
摘要 A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases: (1) b≥ an, max{m, B} 〈 n; (2) a1 ≤ b ≤ an, m ≤ B 〈 n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines. A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases: (1) b≥ an, max{m, B} 〈 n; (2) a1 ≤ b ≤ an, m ≤ B 〈 n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines.
出处 《Journal of Shanghai University(English Edition)》 CAS 2007年第1期33-38,共6页 上海大学学报(英文版)
基金 Project supported by the Science and Technology Development Fund of Shanghai University(Grant No.A.10-0101-06-0017)
关键词 SCHEDULING flexiable flowshop identical machine batch processor COMPLEXITY approximation algorithm scheduling, flexiable flowshop, identical machine, batch processor, complexity, approximation algorithm
  • 相关文献

参考文献11

  • 1Minyi Yue.On the exact upper bound for the multifit processor scheduling algorithm[J].Annals of Operations Research.1990(1)
  • 2Uzsoy R.Scheduling a single batch processing machine with non-identical job sizes[].International Journal of Production Research.1994
  • 3Garey M R,Johnson D S,Sethi R R.The complexity of flowshop and jobshop scheduling[].Mathematics of Operations Research.1976
  • 4Lee C Y,Vairaktarakis G L.Minimizing makespan in hybrid flowshops[].Operations Research.1994
  • 5Graham R L.Bounds on multiprocessing timing anomalies[].SIAM Journal on Applied Mathematics.1969
  • 6Veltman B.Multiprocessor Scheduling with Communication Delays[]..1993
  • 7Narasimhan S L,Panwalker S S.Scheduling in a twostage manufacturing process[].International Journal of Production Research.1984
  • 8Rao T B K.Sequencing in the order A,B with multiplicity of machines for a single operation[].Opsearch.1970
  • 9Deal D E,Hunsucker J L.The two-stage flowshop scheduling problem with m machines at each stage[].Journal of Information.1991
  • 10Chen Bo.Scheduling multiprocessor flow shops[].New Advances in Optimization and Approximation.1994

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部