Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for appraising a multi-objective programing that minimize total weighted tardiness, earliness and total flowtime with fuzzy parameters on parallel machines, simultaneously with respect to the impact of machine deterioration. Besides, in this paper is attempted to present a defuzzification approach and a heuristic method based genetic algorithm (GA) to solve the proposed model. Finally, several dominance properties of optimal solutions are demonstrated in comparison with the results of a state-of-the-art commercial solver and the simulated annealing method that is followed by illustrating some instances for indicating validity and efficiency of the method.

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

[2]  Hiroaki Ishii,et al.  An open shop scheduling problem with fuzzy allowable time and fuzzy resource constraint , 2000, Fuzzy Sets Syst..

[3]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[4]  Marin Litoiu,et al.  Real-time task scheduling with fuzzy deadlines and processing times , 2001, Fuzzy Sets Syst..

[5]  Yang Yi,et al.  Soft computing for scheduling with batch setup times and earliness-tardiness penalties on parallel machines , 2003, J. Intell. Manuf..

[6]  Ertan Güner,et al.  One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs , 1998 .

[7]  Abalfazl Zareei,et al.  Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs , 2010 .

[8]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

[9]  Dong Cao,et al.  Parallel machine selection and job scheduling to minimize machine cost and job tardiness , 2005, Comput. Oper. Res..

[10]  H. Ishii,et al.  Single machine scheduling problem with fuzzy precedence relation , 1995 .

[11]  Hiroaki Ishii,et al.  One machine scheduling problem with fuzzy duedates , 1994 .

[12]  Loren Paul Rees,et al.  Assembly Line Balancing Using Genetic Algorithms with Heuristic‐Generated Initial Populations and Multiple Evaluation Criteria* , 1994 .

[13]  Stanislaw Gawiejnowicz,et al.  Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences , 2006, Discret. Appl. Math..

[14]  Baoding Liu,et al.  Parallel machine scheduling models with fuzzy processing times , 2004, Inf. Sci..

[15]  H. Prade.  Using fuzzy set theory in a scheduling problem: A case study , 1979 .

[16]  Xiaoqiang Cai,et al.  Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs , 1999 .

[17]  M. Kuroda,et al.  Fuzzy Job Shop Scheduling , 1996 .

[18]  Wen-Chiung Lee,et al.  Single-machine group-scheduling problems with deteriorating setup times and job-processing times , 2008 .

[19]  H. Edwin Romeijn,et al.  Parallel machine scheduling: A probabilistic analysis , 1996 .

[20]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[21]  Roberto Musmanno,et al.  Robust scheduling of parallel machines with sequence-dependent set-up costs , 2005, Eur. J. Oper. Res..

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

[23]  Savas Balin,et al.  Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation , 2011, Information Sciences.

[24]  Riccardo Poli,et al.  Smooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study , 1999, EuroGP.

[25]  Jatinder N. D. Gupta,et al.  Single machine scheduling with time deteriorating job values , 2008, J. Oper. Res. Soc..

[26]  Ching-Lai Hwang,et al.  Fuzzy Multiple Attribute Decision Making - Methods and Applications , 1992, Lecture Notes in Economics and Mathematical Systems.

[27]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[29]  Emanuel Falkenauer,et al.  The worth of the uniform [uniform crossover] , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[30]  Zheng Zhou,et al.  A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems , 1996 .

[31]  Vinícius Amaral Armentano,et al.  A heuristic for single machine scheduling with early and tardy costs , 2001, Eur. J. Oper. Res..

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

[33]  Benjamin P.-C. Yen,et al.  Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs , 2009, Eur. J. Oper. Res..

[34]  Tzung-Pei Hong,et al.  A new triangular fuzzy Johnson algorithm , 1999 .

[35]  H. Ishii,et al.  Fuzzy due-date scheduling problem with fuzzy processing time , 1999 .

[36]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[37]  Yan Chen,et al.  Scheduling jobs on parallel machines with setup times and ready times , 2008, Comput. Ind. Eng..

[38]  Michael Pinedo,et al.  PRACTICE‐FOCUSED RESEARCH ISSUES FOR SCHEDULING SYSTEMS* , 2002 .