Bareduan, Sallehahmad and Hasan, Sulaiman (2010) Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach. J. Software Engineering & Applications, 3. pp. 96-102.
![[img]](http://eprints.uthm.edu.my/style/images/fileicons/text.png) |
Text
J4740_2515f1bd53ce29482839d411544fe9ee.pdf Restricted to Registered users only Download (236kB) | Request a copy |
Abstract
This paper presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck approach. The collaborative manufacturing process resembles a permutation re-entrant flow shop environment with four machines executing the process routing of M1,M2,M3,M4,M3,M4 in which the combination of the last three processes of M4,M3,M4 has high tendency of exhibiting dominant machine character�istic. It was shown that using bottleneck-based analysis, effective makespan algorithms and constructive heuristic can be developed to solve for near-optimal scheduling sequence. At strong machine dominance level and medium to large job numbers, this heuristic shows better makespan performance compared to the NEH.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Heuristic; re-entrant flow shop; bottleneck; scheduling; dominant machine. |
| Subjects: | T Technology > T Technology (General) |
| Depositing User: | Mr. Abdul Rahim Mat Radzuan |
| Date Deposited: | 17 Oct 2022 06:15 |
| Last Modified: | 17 Oct 2022 06:15 |
| URI: | http://eprints.uthm.edu.my/id/eprint/7846 |
Actions (login required)
 |
View Item |