"Two-generation Pareto ant colony algorithm for multi-objective job shop ..."

Boxuan Zhao et al. (2018)

> Home

Details and statistics

DOI: 10.1007/S10845-015-1091-Z

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jim/ZhaoGCG18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jim/ZhaoGCG18
Boxuan Zhao, Jianmin Gao, Kun Chen, Ke Guo:
Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines. J. Intell. Manuf. 29(1): 93-108 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.