Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem
The re-entrant flow shop environment has become prominent in the manufacturing industries and has recently attracted researchers attention. Typical examples of re-entrant flow shops are the printed circuit board manufacturing and furniture painting processes where components or processed parts...
Main Author: | Sh Ahmad, Sh Salleh |
---|---|
Format: | Thesis |
Language: | English English English |
Published: |
2009
|
Subjects: | |
Online Access: | http://eprints.uthm.edu.my/7448/1/24p%20SH%20SALLEH%20SH%20AHMAD.pdf http://eprints.uthm.edu.my/7448/2/SH%20SALLEH%20SH%20AHMAD%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/7448/3/SH%20SALLEH%20SH%20AHMAD%20WATERMARK.pdf |
Similar Items
-
Bottleneck-based heuristic for three-machine flow shop scheduling
by: Abdul Rahim, Mohd Salleh
Published: (2011) -
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)