Minimizing makespan and total weighted tardiness for job shop scheduling problem using shifting bottleneck heuristic
Saved in:
Main Author: | Teoh, Lay Eng |
---|---|
Format: | Thesis |
Published: |
2005
|
Subjects: | |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bottleneck-based heuristic for three-machine flow shop scheduling
by: Abdul Rahim, Mohd Salleh
Published: (2011) -
Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
by: Chong, Zheng Ziao
Published: (2015) -
Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem
by: Sh Ahmad, Sh Salleh
Published: (2009) -
Bottleneck-based heuristic for permutation flowshop scheduling
by: Isa, Noor Amira
Published: (2017) -
An ant colony optimization-based algorithm for minimizing the makespan of a job shop problem
by: Abdul Mahad @ Abdul Hamid, Diyana
Published: (2011)