Loading...

A tight lower bound for makespan minimization sequence dependent flowshopgroup scheduling problems

Salmasi, N ; Sharif University of Technology

550 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s10951-012-0288-7
  3. Abstract:
  4. 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 machineproblems, respectively. © 2009 IEEE
  5. Keywords:
  6. Lower bound ; Minimization of makespan ; Sequence dependent group scheduling ; Flow-shop scheduling ; Group scheduling ; Lower bound ; Makespan ; Sequence-dependent ; Industrial engineering ; Machine shop practice ; Optimization ; Scheduling algorithms ; Scheduling
  7. Source: 2009 International Conference on Computers and Industrial Engineering, CIE 2009, 6 July 2009 through 9 July 2009, Troyes ; 2009 , Pages 86-89 ; 9781424441365 (ISBN)
  8. URL: http://ieeexplore.ieee.org/document/5223864