A SINGLE MACHINE SEQUENCING PROBLEM WITH IDLE INSERT: SIMULATED ANNEALING AND BRANCH-AND-BOUND METHODS

In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To compare the associated results, a branch-and-bound (B&B) method is designed and the upper/lower limits are also introduced in this method. To show the effectiveness of these methods, a number of different types of problems are generated and then solved. Based on the results of the test problems, the proposed SA has a small error, and computational time for achieving the best result is very small.

[1]  Amir Azaron,et al.  Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert , 2005, Appl. Math. Comput..

[2]  R. M. Russell,et al.  A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness , 1992 .

[3]  Christos Koulamas,et al.  A heuristic for the single machine tardiness problem , 1993 .

[4]  Chandrasekharan Rajendran,et al.  Scheduling in a cellular manufacturing system: a simulated annealing approach , 1993 .

[5]  Abdelghani Souilah,et al.  Simulated annealing for manufacturing systems layout design , 1995 .

[6]  Kenji Itoh,et al.  A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem , 1995 .

[7]  Ross J. W. James,et al.  A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem , 1997 .

[8]  Candace Arai Yano,et al.  Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates , 1994 .

[9]  Wlodzimierz Szwarc,et al.  Optimal timing schedules in earliness-tardiness single machine sequencing , 1995 .

[10]  Tapan Sen,et al.  On the Single-machine Scheduling Problem with Tardiness Penalties , 1991 .

[11]  Mohamed Ben-Daya,et al.  A simulated annealing approach for the one-machine mean tardiness scheduling problem , 1996 .

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

[13]  A Islam,et al.  A tabu search approach for the single machine mean tardiness problem , 1997 .

[14]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[15]  Candace Arai Yano,et al.  Algorithms for a class of single-machine weighted tardiness and earliness problems , 1991 .

[16]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[17]  Parthasarati Dileepan.  Common due date scheduling problem with separate earliness and tardiness penalties , 1993, Comput. Oper. Res..

[18]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..