Minimizing total tardiness in a scheduling problem with a learning effect

Eren T., Guner E.

APPLIED MATHEMATICAL MODELLING, vol.31, no.7, pp.1351-1361, 2007 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 31 Issue: 7
  • Publication Date: 2007
  • Doi Number: 10.1016/j.apm.2006.03.030
  • Journal Name: APPLIED MATHEMATICAL MODELLING
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1351-1361
  • Keywords: single machine scheduling, tardiness, learning effect, 0-1 integer programming, heuristic methods, Tabu search, MACHINE SEQUENCING PROBLEM, ALGORITHM, DECOMPOSITION, FLOWSHOP, LATENESS, TIME
  • Gazi University Affiliated: No

Abstract

Minimizing of total tardiness is one of the most studied topics on single machine problems. Researchers develop a number of optimizing and heuristic methods to solve this NP-hard problem. In this paper, the problem of minimizing total tardiness is examined in a learning effect situation. The concept of learning effects describes the reduction of processing times arising from process repetition. A 0-1 integer programming model is developed to solve the problem. Also, a random search, the tabu search and the simulated annealing-based methods are proposed for the problem and the solutions of the large size problems with up to 1000 jobs are found by these methods. To the best of our knowledge, no works exists on the total tardiness problem with a learning effect tackled in this paper. (c) 2006 Elsevier Inc. All rights reserved.