Abstract
A dynamic flowshop that continuously receives jobs at random points in time is considered, with the objective of scheduling the jobs in an order that minimizes the mean flowtime. A tabu search is proposed for deciding which job to dispatch next to the flowshop, and the approach is then compared by means of a computational analysis with a number of other competing dispatching rules. The results demonstrate that the search-enhanced dispatching method achieves reductions of between 13% and 17% in the mean flowtimes in comparison to the other dispatching rules. However, the proposed method is not as competitive in comparison to a more complex cooperative dispatching approach when shop congestion levels are medium to low.
| Original language | English |
|---|---|
| Title of host publication | IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management |
| Publisher | IEEE Computer Society |
| Pages | 199-203 |
| Number of pages | 5 |
| Volume | 2016-January |
| ISBN (Electronic) | 9781467380669 |
| DOIs | |
| Publication status | Published - Jan 18 2016 |
| Event | IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015 - Singapore, Singapore Duration: Dec 6 2015 → Dec 9 2015 |
Other
| Other | IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015 |
|---|---|
| Country/Territory | Singapore |
| City | Singapore |
| Period | 12/6/15 → 12/9/15 |
Keywords
- dispatching rules
- flowshop
- flowtime
- tabu search
ASJC Scopus subject areas
- Business, Management and Accounting (miscellaneous)
- Industrial and Manufacturing Engineering
- Safety, Risk, Reliability and Quality