Non-identical parallel-machine scheduling using genetic algorithm and fuzzy logic approach

Manufacturing industries frequently face the problem of reducing earliness and tardiness penalties, owing to the emerging concept of the just-in-time production philosophy. The problem studied in this work is the Non-identical Parallel-machine–Earliness-Tardiness Non-common Due Date–Sequence-dependent Set-up Time Scheduling Problem (NPETNDDSP) for jobs with varying processing times, where the objective is to minimise the sum of the absolute deviations of job completion times from their corresponding due dates for the different weighted earliness and tardiness combinations. A Genetic Algorithm-Fuzzy Logic Approach (GA-Fuzzy) has been proposed to select the optimal weighted earliness-tardiness combinations in a non-identical parallel-machine environment. The performance of the combined objective function obtained by the proposed GA-Fuzzy technique has been compared with the solutions yielded by the Genetic Algorithm (GA) techniques available in literature, known as GA with Partially Mapped Crossover Operator (GA-PMX) and GA with Multi-Component Uniform Order-based Crossover Generator (GA-MCUOX). The comparison shows that the proposed GA-Fuzzy technique outperforms both the GA-PMX and GA-MCUOX.

[1]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

[2]  Michel Gendreau,et al.  A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 1996 .

[3]  Ram Rachamadugu.  Scheduling jobs with proportionate early/tardy penalties , 1995 .

[4]  R. Saravanan,et al.  Scheduling optimisation of flexible manufacturing systems using particle swarm optimisation algorithm , 2005 .

[5]  R. Saravanan,et al.  Machining Parameters Optimisation for Turning Cylindrical Stock into a Continuous Finished Profile Using Genetic Algorithm (GA) and Simulated Annealing (SA) , 2003 .

[6]  R. Sumichrast,et al.  Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time , 1987 .

[7]  Shigeo Abe,et al.  A genetic algorithm approach to multi-objective scheduling problems with earliness and tardiness penalties , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[8]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[9]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[10]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[11]  Massimo Paolucci,et al.  Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach , 2007, Comput. Oper. Res..

[12]  Furkan Kiraç,et al.  A tabu search algorithm for parallel machine total tardiness problem , 2004, Comput. Oper. Res..

[13]  Chun-Yuan Cheng,et al.  Scheduling unrelated parallel machines to minimize total weighted tardiness , 2003, 2006 IEEE International Conference on Service Operations and Logistics, and Informatics.

[14]  Reha Uzsoy,et al.  Production scheduling algorithms for a semiconductor test facility , 1991 .

[15]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

[16]  Martin Feldmann,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .

[17]  Mitsuo Gen,et al.  Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms , 1995 .

[18]  Lotfi A. Zadeh,et al.  Fuzzy Sets , 1996, Inf. Control..

[19]  Johnny C. Ho,et al.  Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs , 2007, Eur. J. Oper. Res..

[20]  Jose A. Ventura,et al.  Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints , 2003, Comput. Oper. Res..

[21]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

[22]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[23]  Chien-Chung Lo,et al.  hybrid genetic algorithms for minimizing the maximum completion time for the wafer probing scheduling problem , 2003 .

[24]  Nicholas G. Hall.  Single- and multiple-processor models for minimizing completion time variance , 1986 .

[25]  Richard Bellman,et al.  Decision-making in fuzzy environment , 2012 .

[26]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

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

[28]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..

[29]  Jose A. Ventura,et al.  Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times , 2000 .

[30]  Mitsuo Gen,et al.  Parallel machine scheduling problems using memetic algorithms , 1997 .

[31]  Reha Uzsoy,et al.  Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine , 1992 .

[32]  Manoj Kumar,et al.  A fuzzy goal programming approach for vendor selection problem in a supply chain , 2004, Comput. Ind. Eng..

[33]  Gur Mosheiov,et al.  Minmax earliness-tardiness costs with unit processing time jobs , 2001, Eur. J. Oper. Res..

[34]  Guoqing Wang,et al.  Parallel machine earliness and tardiness scheduling with proportional weights , 2003, Comput. Oper. Res..