首页    期刊浏览 2025年04月19日 星期六
登录注册

文章基本信息

  • 标题:Branch and Bound Technique To Two Stage Flow Shop Scheduling Problem In Which Setup Time is Separated From Processing Time And Both Are Associated With Probabilities
  • 本地全文:下载
  • 作者:Deepak Gupta ; Harminder Singh
  • 期刊名称:International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
  • 印刷版ISSN:2278-1323
  • 出版年度:2012
  • 卷号:1
  • 期号:7
  • 页码:141-143
  • 出版社:Shri Pannalal Research Institute of Technolgy
  • 摘要:This paper presents an algorithm with the help of branch and bound approach for a flow shop scheduling problems consisting of n jobs to be processed on 2 machines in which setup time is separated from processing time and both are associated with probabilities
  • 关键词:Processing time ;Elapsed time; Branch and ; Bound ;Setup time
国家哲学社会科学文献中心版权所有