Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
Permutation flow shop problem (PFSP) is one of the commonly reviewed machine environments in scheduling problems. The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in f...
Saved in:
Main Author: | Chong, Zheng Ziao |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://eprints.usm.my/41022/1/CHONG_ZHENG_ZIAO_24_Pages.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Thermal And Flow Analysis Of
Piezoelectric Fans For Cooling LEDS
Packages
by: Shaker , Sufian Farid
Published: (2014) -
Flow And Sediment Pattern Simulation At Ijok Intake, District Of Larut Matang, Perak
by: Shahidan, Noor Fareezianna Noor
Published: (2012) -
Investigation Of Water Flow Over Contracted Rectangular Flat-Crested Slit Weir In Open Channel
by: Jaafar , Rosley
Published: (2009) -
Diagnosis Using Bayesian Networks To Enable Value-Added
Troubleshooting To Manufacturing Process Problem.
by: Mohd Fadzil, Lokman
Published: (2007) -
Minimizing makespan and total weighted tardiness for job shop scheduling problem using shifting bottleneck heuristic
by: Teoh, Lay Eng
Published: (2005)