Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop
Permutation flow shop problem (PFSP) is one of the important subclass of scheduling, where the order in each process remains unchanged for all machines. Few algorithms have been developed for deciding the sequence of n jobs and m machines to minimize makespan in the flow shop. Throughout the last 30...
| Main Authors: | Ziao, C.Z., Kamaruddin, S. |
|---|---|
| Format: | Conference or Workshop Item |
| Institution: | Universiti Teknologi Petronas |
| Record Id / ISBN-0: | utp-eprints.26292 / |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2015
|
| Online Access: |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84931036319&doi=10.1109%2fIEOM.2015.7093718&partnerID=40&md5=bbec684c1f4e3f697ca38535cbab2d82 http://eprints.utp.edu.my/26292/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|