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...
Saved in:
Main Authors: | Ziao, C.Z., Kamaruddin, S. |
---|---|
Format: | Conference or Workshop Item |
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!
|
Similar Items
-
Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
by: Chong, Zheng Ziao
Published: (2015) -
Minimizing makespan and total weighted tardiness for job shop scheduling problem using shifting bottleneck heuristic
by: Teoh, Lay Eng
Published: (2005) -
Methodology to develop bottleneck-based heuristic for permutation flow shop scheduling
by: Isa, Noor Amira, et al.
Published: (2020) -
Minimize the makespan for job shop scheduling problem using artificial immune system approach
by: Muhamad, A. S., et al.
Published: (2015) -
Minimizing makespan of multimachine production system in flow shop environment by means of mixed integer programming model
by: Abdul Rahman, Nur Salihah, et al.
Published: (2018)