Skip to main content

Advertisement

SpringerLink
Log in

A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This study presents a multiobjective scheduling model on parallel machines (MOSP). Compared with other scheduling problems on parallel machines, the MOSP is distinct for the following characteristics: (1) parallel machines are nonidentical, (2) the type of jobs processed on each machine can be restricted, and (3) the multiobjective scheduling problem includes minimizing the maximum completion time among all the machines (makespan) and minimizing the total earliness/tardiness penalty of all the jobs. To solve the MOSP, a new parallel genetic algorithm (PIGA) based on the vector group encoding method and the immune method is proposed. For PIGA, its three distinct characteristics are as follows: Firstly, individuals are represented by a vector group, which can effectively reflect the virtual scheduling policy. Secondly, an immune operator is adopted and studied in order to guarantee diversity of the population. Finally, a local search algorithm is applied to improve the quality of the population. Numerical results show that it is efficient, can better overcome drawbacks of the general genetic algorithm, and has better parallelism.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Graham RL (1969) Bounds on multiprocessor timing anomalies. SIAM J Appl Math 17:416–429

    Article  MATH  MathSciNet  Google Scholar 

  2. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. Freeman, San Francisco

    MATH  Google Scholar 

  3. Lee CY, Massey JD (1988) Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl Math 20:233–242

    Article  MATH  MathSciNet  Google Scholar 

  4. Rajendran C (1995) Heuristics for scheduling in flowshop with multiple objectives. Eur J Oper Res 82:540–555

    Article  MATH  Google Scholar 

  5. Nagar A, Heragu S, Haddock J (1995) A branch and bound approach for a two-machine flowshop scheduling problem. J Oper Res Soc 46:721–734

    Article  MATH  Google Scholar 

  6. Riera J, Alcaide D, Sicilia J (1996) Approximate algorithms for the PCmax problem. Topology 4:345–359

    MATH  MathSciNet  Google Scholar 

  7. Sridhar J, Rajendran C (1996) Scheduling in flowshop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach. Prod Plan Control 7:374–382

    Article  Google Scholar 

  8. James RJW (1997) Using tabu search to solve the common due date early/tardy machine scheduling problem. Comput Oper Res 24:199–208

    Article  MATH  MathSciNet  Google Scholar 

  9. Gupta JND, Ruiz-Torres AJ (2001) A LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod Plan Control 12:28–36

    Article  Google Scholar 

  10. Wang L, Li DW (2002) Genetic algorithm for parallel machine scheduling with due windows. J Sys Eng 17:45–49

    Google Scholar 

  11. de Castro LN, Timmis J (2002) Artificial immune system: a new computational intelligence approach. Springer, New York

    MATH  Google Scholar 

  12. Gupta JND, Ho JC, Ruiz-Torres AJ (2004) Makespan minimization on identical parallel machines subject to minimum total flow-time. J Chin Inst Ind Eng 21:220–229

    Google Scholar 

  13. Gao JQ (2005) A parallel hybrid genetic algorithm for solving a kind of non-identical parallel machine scheduling problems. In: Proceedings of the eighth conference on high-performance computing in Asia-Pacific Region, Beijing. IEEE Computer Society, Los Alamitos, pp 469–472

    Google Scholar 

  14. Lee WC, Wu CC, Chen P (2006) A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Technol 31:328–334

    Article  Google Scholar 

  15. Tang LX, Luo JX (2006) A new ILS algorithm for parallel machine scheduling problems. J Intell Manuf 17:609–619

    Article  Google Scholar 

  16. Lin SW, Chou SY, Chen SC (2006) Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date. J Heuristics 13:151–165

    Article  Google Scholar 

  17. Liao CJ, Chen CM Lin CH (2007) Minimizing makespan for two parallel machines with job limit on each availability interval. J Oper Res Soc 58:938–947

    Article  MATH  Google Scholar 

  18. Tsai T (2007) A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times. Int J Adv Manuf Technol 31:994–1000

    Article  Google Scholar 

  19. Liao CJ, Chen CM (2007) A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput Ind Eng 52:404–413

    Article  Google Scholar 

  20. Zhang ZC, Zheng L, Weng MX (2007) Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning. Int J Adv Manuf Technol 34:968–980

    Article  Google Scholar 

  21. Cheng TCE, Kang LY, Ng CT (2007) Due-date assignment and parallel-machine scheduling with deteriorating jobs. J Oper Res Soc 58:1103–1108

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zhijiang College, Zhejiang University of Technology, Hangzhou, Zhejiang Province, 310024, China

    Jiaquan Gao & Guixia He

  2. School of Mathematics and Computer Science, Nanjing Normal University, Nanjing, Jiangshu Province, 210097, China

    Yushun Wang

Authors
  1. Jiaquan Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guixia He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yushun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiaquan Gao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, J., He, G. & Wang, Y. A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint. Int J Adv Manuf Technol 43, 151–160 (2009). https://doi.org/10.1007/s00170-008-1683-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1683-2

Keywords

Search

Navigation