A Hybridized Approach for Solving Group Shop Problems (GSP)
Master's
Saved in:
Main Author: | TAN MU YEN |
---|---|
Other Authors: | INDUSTRIAL & SYSTEMS ENGINEERING |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/15229 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
Design and analysis of algorithms for solving a class of routing shop scheduling problems
by: LIU SHUBIN
Published: (2011) -
Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems
by: Yang, J.-h., et al.
Published: (2014) -
Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
by: Liu, S.Q., et al.
Published: (2014) -
Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
by: Liu, S.Q., et al.
Published: (2014) -
A fast tabu search algorithm for the group shop scheduling problem
by: Liu, S.Q., et al.
Published: (2014)