Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan

[1]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

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

[3]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[4]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

[5]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

[6]  Guochuan Zhang,et al.  Minimizing makespan on a single batch processing machine with nonidentical job sizes , 2001 .

[7]  Clarisse Dhaenens,et al.  Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure , 2002, Comput. Oper. Res..

[8]  Purushothaman Damodaran,et al.  Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .

[9]  Sharif H. Melouk,et al.  Minimizing makespan on parallel batch processing machines , 2004 .

[10]  Pyung-Hoi Koo,et al.  Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families , 2004 .

[11]  Xiaoli Wang,et al.  Minimizing makespan on a single batching machine with release times and non-identical job sizes , 2005, Oper. Res. Lett..

[12]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

[13]  Purushothaman Damodaran,et al.  Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms , 2006 .

[14]  Fariborz Jolai,et al.  Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes , 2006 .

[15]  James C. Bean,et al.  A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[16]  Chung-Lun Li,et al.  Scheduling parallel machines with inclusive processing set restrictions , 2008 .

[17]  Purushothaman Damodaran,et al.  Heuristics to minimize makespan of parallel batch processing machines , 2008 .

[18]  Ali Husseinzadeh Kashan,et al.  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes , 2008, Comput. Oper. Res..

[19]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

[20]  Ali Husseinzadeh Kashan,et al.  A note on minimizing makespan on a single batch processing machine with nonidentical job sizes , 2009, Theor. Comput. Sci..

[21]  Omar Ghrayeb,et al.  A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines , 2012 .