Loading...

A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties

Keshavarz, T ; Sharif University of Technology

621 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.apm.2015.01.069
  3. Abstract:
  4. The NP-hard single machine sequence-dependent group scheduling problem with minimization of total weighted earliness and tardiness is investigated. An arc-time-indexed formulation is presented and a Lagrangian-based branch-and-bound algorithm is proposed. The Lagrangian relaxation of the arc-time-indexed formulation is solved as a shortest path problem. The results of an extensive computational study demonstrate the efficacy of the proposed algorithm and establish characteristics of some hard to solve instances
  5. Keywords:
  6. Minimization of earliness and tardiness ; Algorithms ; Branch and bound method ; Graph theory ; Group technology ; Lagrange multipliers ; Optimization ; Scheduling ; Branch-and-bound algorithms ; Earliness and tardiness ; Group scheduling ; LaGrangian relaxation ; Sequence-dependent setup time ; Time-indexed formulation ; Scheduling algorithms
  7. Source: Applied Mathematical Modelling ; Volume 39, Issue 20 , October , 2015 , Pages 6410–6424 ; 0307904X (ISSN)
  8. URL: http://www.sciencedirect.com/science/article/pii/S0307904X15000724