Uniform parallel machine scheduling with resource consumption constraint

Abstract We consider the makespan problem on uniform parallel machines, given that some resource consumption cannot exceed a certain level. Several meta-heuristic methods are proposed to generate approximate solutions. Computational results are also provided to demonstrate the performance of the proposed heuristic algorithms.

[1]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[2]  Ali Azadeh,et al.  A particle swarm algorithm for inspection optimization in serial multi-stage processes , 2012 .

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[4]  Reinout Heijungs,et al.  Theoretical exploration for the combination of the ecological, energy, carbon, and water footprints: Overview of a footprint family , 2014 .

[5]  Radoslaw Rudek,et al.  A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models , 2011, Comput. Math. Appl..

[6]  Marcus Randall,et al.  Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution , 2013 .

[7]  Peter Chen,et al.  A simulated annealing approach to makespan minimization on identical parallel machines , 2006 .

[8]  Christos Koulamas,et al.  A modified LPT algorithm for the two uniform parallel machine makespan minimization problem , 2009, Eur. J. Oper. Res..

[9]  Ping Ji,et al.  Single-machine scheduling with time-and-resource-dependent processing times , 2012 .

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  Wei-Chang Yeh,et al.  A new hybrid approach for mining breast cancer pattern using discrete particle swarm optimization and statistical method , 2009, Expert Syst. Appl..

[12]  Wei-Chang Yeh,et al.  Uniform parallel-machine scheduling to minimize makespan with position-based learning curves , 2012, Comput. Ind. Eng..

[13]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[14]  Iraj Mahdavi,et al.  A new linear programming approach and genetic algorithm for solving airline boarding problem , 2012 .

[15]  Adam Janiak,et al.  A note on a makespan minimization problem with a multi-ability learning effect , 2010 .

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

[17]  T. C. Edwin Cheng,et al.  Parallel-machine scheduling of simple linear deteriorating jobs , 2009, Theor. Comput. Sci..

[18]  Xue-Ru Wang,et al.  Single-machine scheduling with convex resource dependent processing times and deteriorating jobs , 2013 .

[19]  Lai Soon Lee,et al.  Optimised crossover genetic algorithm for capacitated vehicle routing problem , 2012 .

[20]  S.M.T. Fatemi Ghomi,et al.  A pairwise interchange algorithm for parallel machine scheduling , 1998 .

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

[22]  T. C. Edwin Cheng,et al.  An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan , 2008, Inf. Process. Lett..

[23]  Shanlin Yang,et al.  Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes , 2012 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Radoslaw Rudek,et al.  Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect , 2011, Comput. Ind. Eng..

[26]  Yang-Kuei Lin,et al.  Fast LP models and algorithms for identical jobs on uniform parallel machines , 2013 .

[27]  Radosław Rudek,et al.  On flowshop scheduling problems with the aging effect and resource allocation , 2012 .

[28]  Mohamad Y. Jaber,et al.  Learning Curves : Theory, Models, and Applications , 2011 .

[29]  Nima Hamta,et al.  Bi-criteria assembly line balancing by considering flexible operation times , 2011 .

[30]  Xue Huang,et al.  Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties , 2011 .

[31]  Jatinder N. D. Gupta,et al.  A LISTFIT heuristic for minimizing makespan on identical parallel machines , 2001 .

[32]  R. J. Kuo,et al.  A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem – A case study on supply chain model , 2011 .

[33]  Mohamad Y. Jaber,et al.  Learning and forgetting models and their applications , 2013 .

[34]  Rubén Ruiz,et al.  Size-reduction heuristics for the unrelated parallel machines scheduling problem , 2011, Comput. Oper. Res..

[35]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..