A distance based variable neighborhood search for parallel machine scheduling

Throughout the years, scheduling problems have been broadly addressed in the literature due to their wide application in practice. Some examples include the production line optimization, the scheduling aircraft landing, the daily nurse care, among others. In this work one investigate the efficiency of applying geometric-based operators in a version of this problem that deals with the schedule of n independent tasks for m parallel machines, which can be either identical or unrelated. In order to validate this study, a Variable Neighborhood Search approach is proposed and applied to a specific scheduling problem regarding the minimization of the weighted sum of the earliness/tardiness task, a well-known NP-Hard problem. The test instances are solved for either a due date known a priori or not. The algorithm is compared with two other methods from the literature and the results show promising.

[1]  S. T. Webster,et al.  The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..

[2]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[3]  John W. Fowler,et al.  A SURVEY OF ALGORITHMS FOR SINGLE AND MULTI-OBJECTIVE UNRELATED PARALLEL-MACHINE DETERMINISTIC SCHEDULING PROBLEMS , 2004 .

[4]  Elizabeth F. Wanner,et al.  Continuous-space embedding genetic algorithm applied to the Degree Constrained Minimum Spanning Tree Problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

[5]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[6]  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..

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

[8]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[9]  Rubén Ruiz,et al.  Iterated greedy local search methods for unrelated parallel machine scheduling , 2010, Eur. J. Oper. Res..

[10]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[11]  Alin Mihaila,et al.  An Evolutionary Algorithm for Uniform Parallel Machines Scheduling , 2008, 2008 Second UKSIM European Symposium on Computer Modeling and Simulation.

[12]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[13]  Ricardo H. C. Takahashi,et al.  Nonlinear Network Optimization—An Embedding Vector Space Approach , 2010, IEEE Transactions on Evolutionary Computation.

[14]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[15]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[16]  Alberto Moraglio,et al.  Towards a geometric unification of evolutionary algorithms , 2008 .

[17]  Ghaith Rabadi,et al.  Ant colony optimization algorithm to parallel machine scheduling problem with setups , 2008, 2008 IEEE International Conference on Automation Science and Engineering.

[18]  Alberto Moraglio,et al.  Geometric Crossovers for Multiway Graph Partitioning , 2007, Evolutionary Computation.

[19]  Alhandra C. M. A. Tepedino,et al.  Distance based NSGA-II for earliness and tardiness minimization in Parallel Machine Scheduling , 2013, 2013 IEEE Congress on Evolutionary Computation.

[20]  Chung-Lun Li,et al.  The parallel machine min-max weighted absolute lateness scheduling problem , 1994 .

[21]  Eduardo G. Carrano.  Algoritmos evolucionários eficientes para otimização de redes , 2007 .

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

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

[24]  J. A. Hoogeveen,et al.  Scheduling around a small common due date , 1991 .

[25]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures , 2000, Discret. Math..

[26]  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..

[27]  Joel J. P. C. Rodrigues,et al.  Metaheuristic Scheduling for Cloud: A Survey , 2014, IEEE Systems Journal.

[28]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[29]  Gilbert Laporte,et al.  Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading , 2007, INFORMS J. Comput..