A Simulated Annealing Algorithm for JIT Single Machine Scheduling with Preemption and Machine Idle Time

This article is related to concept of preemption in just-in-time single machine shop with allowable machine idle time. According to the operation research model of this problem, Lingo software can easily solve small problems, but it cannot solve the average and big problems. The purpose of this article is to provide a simulated annealing algorithm for solving this problem. The suggested simulated annealing algorithm gives the answers, which are quite close to the optimal solution in the tested problems. The runtime solution problem by using the suggested algorithm is much less than by using the Lingo software. The numerical examples show that the efficiency of SA algorithm is quite high.

[1]  Francis Sourd,et al.  The one-machine just-in-time scheduling problem with preemption , 2009, Discret. Optim..

[2]  Francis Sourd,et al.  Punctuality and idleness in just-in-time scheduling , 2005, Eur. J. Oper. Res..

[3]  Safia Kedad-Sidhoum,et al.  The One-Machine Problem with Earliness and Tardiness Penalties , 2003, J. Sched..

[4]  Han Hoogeveen,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[5]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[6]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[7]  Kerem Bülbül,et al.  Preemption in single machine earliness/tardiness scheduling , 2007 .

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[10]  Han Hoogeveen,et al.  A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time , 1996, INFORMS J. Comput..

[11]  Safia Kedad-Sidhoum,et al.  A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem , 2008, J. Sched..

[12]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[13]  Francis Sourd,et al.  Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem , 2006, Eur. J. Oper. Res..

[14]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[15]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[16]  Joanna Józefowska,et al.  Just-in-Time Scheduling : Models and Algorithms for Computer and Manufacturing Systems , 2007 .

[17]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[18]  Ching-Jong Liao,et al.  A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date , 2007, Comput. Ind. Eng..