Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach
This paper presents a bottleneck-based methodology to solve scheduling problem of M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant machines. Two generalised makespan algorithms using bottleneck approach were developed for the identified bottleneck...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://eprints.uthm.edu.my/8049/1/J4741_d0bca5a4021271c23fab3726ebba24d6.pdf http://eprints.uthm.edu.my/8049/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833418555221082112 |
|---|---|
| author | Bareduan, Salleh Ahmad Hasan, Sulaiman |
| author_facet | Bareduan, Salleh Ahmad Hasan, Sulaiman |
| author_sort | Bareduan, Salleh Ahmad |
| building | UTHM Library |
| collection | Institutional Repository |
| content_provider | Universiti Tun Hussein Onn Malaysia |
| content_source | UTHM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | This paper presents a bottleneck-based methodology to solve scheduling problem of
M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant
machines. Two generalised makespan algorithms using bottleneck approach were developed for the
identified bottleneck. Each algorithm has specific correction factor which was used to ensure the accuracy
of the makespan computation. Using these correction factors, a constructive heuristic was developed to
solve for near-optimal scheduling sequence. For small size problems, the heuristic results were compared
with the optimum makespan generated from complete enumeration. For medium and large size problems,
the heuristic performance was measured by comparing its makespan with the solutions generated by the
NEH and lowerbound. At weak and strong dominance level, the heuristic shows good performance against
the lowerbound and better results compared to the NEH for large and medium size problems. |
| format | Article |
| id | my.uthm.eprints-8049 |
| institution | Universiti Tun Hussein Onn Malaysia |
| language | en |
| publishDate | 2012 |
| record_format | eprints |
| spelling | my.uthm.eprints-80492022-12-06T02:52:53Z http://eprints.uthm.edu.my/8049/ Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach Bareduan, Salleh Ahmad Hasan, Sulaiman T Technology (General) This paper presents a bottleneck-based methodology to solve scheduling problem of M1,M2,M3,M4,M3,M4 re-entrant flow shop where M1 and M4 have high tendency of being the dominant machines. Two generalised makespan algorithms using bottleneck approach were developed for the identified bottleneck. Each algorithm has specific correction factor which was used to ensure the accuracy of the makespan computation. Using these correction factors, a constructive heuristic was developed to solve for near-optimal scheduling sequence. For small size problems, the heuristic results were compared with the optimum makespan generated from complete enumeration. For medium and large size problems, the heuristic performance was measured by comparing its makespan with the solutions generated by the NEH and lowerbound. At weak and strong dominance level, the heuristic shows good performance against the lowerbound and better results compared to the NEH for large and medium size problems. 2012 Article PeerReviewed text en http://eprints.uthm.edu.my/8049/1/J4741_d0bca5a4021271c23fab3726ebba24d6.pdf Bareduan, Salleh Ahmad and Hasan, Sulaiman (2012) Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach. International Journal of Combinational Optimization Problems & Informatics, 3 (3). |
| spellingShingle | T Technology (General) Bareduan, Salleh Ahmad Hasan, Sulaiman Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach |
| title | Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach |
| title_full | Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach |
| title_fullStr | Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach |
| title_full_unstemmed | Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach |
| title_short | Methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach |
| title_sort | methodology to develop heuristic for re-entrant flow shop with two potential dominant machines using bottleneck approach |
| topic | T Technology (General) |
| url | http://eprints.uthm.edu.my/8049/1/J4741_d0bca5a4021271c23fab3726ebba24d6.pdf http://eprints.uthm.edu.my/8049/ |
| url_provider | http://eprints.uthm.edu.my/ |