Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach

  • Ali Husseinzadeh Kashan
  • Behrooz Karimi
  • Fariborz Jolai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3906)


This paper addresses minimizing makespan by genetic algorithm (GA) for scheduling jobs with non-identical sizes on a single batch processing machine. We propose two different genetic algorithms based on different encoding schemes. The first one is a sequence based GA (SGA) that generates random sequences of jobs and applies the batch first fit (BFF) heuristic to group the jobs. The second one is a batch based hybrid GA (BHGA) that generates random batches of jobs and ensures feasibility through using knowledge of the problem. A pairwise swapping heuristic (PSH) based on the problem characteristics is hybridized with BHGA that has the ability of steering efficiently the search toward the optimal or near optimal schedules. Computational results show that BHGA performs considerably well compared with a modified lower bound and significantly outperforms the SGA and a simulated annealing (SA) approach addressed in literature. In comparison with a constructive heuristic named FFLPT, BHGA also shows its superiority.


Longe Processing Time Initial Batch Batch Processing Machine Optimal Makespan Batch Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Uzsoy, R.: A single batch processing machine with non-identical job sizes. International Journal of Production Research 32, 1615–1635 (1994)CrossRefMATHGoogle Scholar
  2. 2.
    Dupont, L., Jolai Ghazvini, F.: Minimizing makespan on a single batch processing machine with non identical job sizes. European journal of Automation Systems 32, 431–440 (1998)Google Scholar
  3. 3.
    Jolai Ghazvini, F., Dupont, L.: Minimizing mean flow time on a single batch processing machine with non- identical job size. International Journal of Production Economics 55, 273–280 (1998)CrossRefGoogle Scholar
  4. 4.
    Dupont, L., Dhaenens-Flipo, C.: Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research 29, 807–819 (2002)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Melouk, S., Damodaran, P., Chang, P.Y.: Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics 87, 141–147 (2004)CrossRefGoogle Scholar
  6. 6.
    Shuguang, L., Guojun, L., Xiaoli, W., Qiming, L.: Minimizing makespan on a single batching machine with release times and non-identical job sizes. Operations Research Letter 33, 157–164 (2005)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal of Computing 6, 154–160 (1994)CrossRefMATHGoogle Scholar
  8. 8.
    Wang, C., Uzsoy, R.: A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers & Operations Research 29, 1621–1640 (2002)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ali Husseinzadeh Kashan
    • 1
  • Behrooz Karimi
    • 1
  • Fariborz Jolai
    • 2
  1. 1.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran
  2. 2.Department of Industrial Engineering, Faculty of EngineeringUniversity of TehranTehranIran

Personalised recommendations