文章基本信息

标题：Branch and Bound Technique in Two Stage Flow Shop Scheduling Problem Including idle/waiting Time Operator Oi,w For a Job Block Where Jobs Are Performed in The Form of String
本地全文：下载
作者：Deepak Gupta ; Harminder Singh ; Sameer Sharma 等
期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：7
页码：137-140
出版社：Shri Pannalal Research Institute of Technolgy
摘要：This paper presents an algorithm with the help of branch and bound approach for a flowshop scheduling problems consisting of n jobs to be processed on 2 machines in which idle/waiting Time Operator Oi,wfor a job block and all the jobs are performed in the form of string .the objective is to getthe optimal sequence of jobs to minimize the total elapsed time.
关键词：Equivalent job; processing time ;elapsed time; ; branch and bound