Loading...

Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness

Moslehi, G ; Sharif University of Technology | 2009

612 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.ijpe.2009.07.003
  3. Publisher: 2009
  4. Abstract:
  5. This paper presents optimal scheduling in a two-machine flow shop, in which the objective function is to minimize the sum of maximum earliness and tardiness (n/2/P/ETmax). Since this problem tries to minimize earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). This objective function has already been considered for n jobs and m machines, but the proposed algorithms are not efficient to solve large scale problems. In this paper, neighborhood conditions are developed and the dominant set for any optimal solution is determined. The branch-and-bound (B&B) method is used to solve the problem and the proper upper and lower bounds are also introduced. A number of effective lemmas are introduced to develop an algorithm which is more efficient than those already known. To show the effectiveness of the proposed algorithm, 380 problems of different sizes are randomly generated and solved. More than 82% of the problems are shown to reach optimal solutions. © 2009 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Scheduling ; Branch and bounds ; Branch-and-bound ; Different sizes ; Dominant set ; Flow shop ; Flow-shop scheduling ; Flow-shops ; Just-in-time ; Just-in-time (JIT) systems ; Large-scale problem ; Maximum earliness ; Objective functions ; Optimal scheduling ; Optimal solutions ; Production system ; Upper and lower bounds ; Algorithms ; Control theory ; Just in time production ; Machine shop practice ; Optimal systems ; Problem solving ; Branch and bound method
  8. Source: International Journal of Production Economics ; Volume 122, Issue 2 , 2009 , Pages 763-773 ; 09255273 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0925527309002424