Loading...
Search for:
minimization-of-makespan
0.01 seconds
Parallel machine scheduling problem with preemptive jobs and transportation delay
, Article Computers and Operations Research ; Vol. 50, issue , Oct , 2014 , p. 14-23 ; Salmasi, N ; Sharif University of Technology
Abstract
In this research the parallel machine scheduling problem with preemption by considering a constant transportation delay for migrated jobs and minimization of makespan as the criterion i.e., Pm|pmtn(delay)|Cmax is investigated. It is assumed that when a preempted job resumes on another machine, it is required a delay between the processing time of the job on these two machines. This delay is called transportation delay. We criticize an existing mathematical model for the research problem in the literature [Boudhar M, Haned A. Preemptive scheduling in the presence of transportation times. Computers & Operations Research 2009; 36(8):2387-93]. Then, we prove that there exists an optimal schedule...
A tight lower bound for makespan minimization sequence dependent flowshopgroup scheduling problems
, Article 2009 International Conference on Computers and Industrial Engineering, CIE 2009, 6 July 2009 through 9 July 2009, Troyes ; 2009 , Pages 86-89 ; 9781424441365 (ISBN) ; Davarnia, D ; Logendran, R ; Sharif University of Technology
Abstract
In this paper a lower bounding method for the flowshop sequence dependentgroups scheduling problems by minimization of makespan criterion (Fm|fmls, Sijkprmu|Cmax) is proposed. Theperformance of the proposed lower bound (LB) is compared with the availablelower bounding methods in literature. In order to do this, the performance ofthe proposed LB and the one available in literature are compared with theavailable upper bound in literature based on solving the available testproblems. The results show that the proposed LB has a superior performancecompared to the available ones in literature. The average percentage error ofthe proposed LB for the test problems is 1.1% and 1.4% for three and six...