Bottleneck-based heuristic for three-machine flow shop scheduling
This paper considers a 3 machine flow shop (M1M2M3) with tendency of dominant (bottleneck) machine at M1. The developed bottleneck based heuristics from previous studies are considered in this case by Hezzeril (2010) and Irwan (2010), but were only tested for dominant machine at M2 and M3 respect...
Saved in:
Main Author: | Abdul Rahim, Mohd Salleh |
---|---|
Format: | Thesis |
Language: | English English English |
Published: |
2011
|
Subjects: | |
Online Access: | http://eprints.uthm.edu.my/2724/1/24p%20MOHD%20SALLEH%20ABDUL%20RAHIM.pdf http://eprints.uthm.edu.my/2724/2/MOHD%20SALLEH%20ABDUL%20RAHIM%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/2724/3/MOHD%20SALLEH%20ABDUL%20RAHIM%20WATERMARK.pdf http://eprints.uthm.edu.my/2724/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem
by: Sh Ahmad, Sh Salleh
Published: (2009) -
Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem
by: N. A., Isa, et al.
Published: (2021) -
Job shop scheduling problem (JSSP)
by: Abdullah, Nurul Azma
Published: (2004) -
Dynamic weighted idle time heuristic for flowshop scheduling
by: Zainudin, Amira Syuhada
Published: (2017) -
A guided artificial bee colony (GABC) heuristic for permutation flowshop scheduling problem (PFSP)
by: Sidek, Noor Azizah
Published: (2021)