期刊名称:International Journal of Electronics and Computer Science Engineering
电子版ISSN:2277-1956
出版年度:2013
卷号:2
期号:2
页码:483-491
出版社:Buldanshahr : IJECSE
摘要:The specific goal of this paper is to present an efficient heuristic for n-jobs, two machine open shop scheduling involving job block criteria and weights of jobs due to their relative importance, under the condition when probabilities are associate with processing time to obtain an optimal or near optimal sequence which minimize the makespan. The proposed heuristic developed in this paper is straightforward and provides an optimal sequence in an effective manner.
关键词:Open Shop Scheduling ; Total elapsed time; Job block; Weighs of jobs.