Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems
10.1016/S1672-6529(08)60014-1
Saved in:
Main Authors: | Yang, J.-h., Sun, L., Lee, H.P., Qian, Y., Liang, Y.-c. |
---|---|
Other Authors: | MECHANICAL ENGINEERING |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/59713 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
by: Gao, Kai Zhou, et al.
Published: (2016) -
A Hybridized Approach for Solving Group Shop Problems (GSP)
by: TAN MU YEN
Published: (2010) -
Learning iterative dispatching rules for job shop scheduling with genetic programming
by: Nguyen, S., et al.
Published: (2014) -
An application of tabu search algorithm on cost-based job shop problem with multiple objectives
by: Zhu, Z.C., et al.
Published: (2014) -
Replanning the master production schedule for a capacity-constrained job shop
by: Kum Khiong, Y., et al.
Published: (2013)