| Article ID: | iaor20053107 |
| Country: | China |
| Volume: | 22 |
| Issue: | 2 |
| Start Page Number: | 56 |
| End Page Number: | 59 |
| Publication Date: | Jun 2004 |
| Journal: | Journal of Hubei Institute for Nationalities |
| Authors: | Shi Ling |
| Keywords: | analytic hierarchy process |
We study a flowshop scheduling problem with transportation times and a single robot. Additionally, transportation times are considered if a job changes from one machine to another and all transportation must be done by a single robot. For the two-machine case, we prove that this problem is NP-hard in the strong sense and an improved heuristic algorithm guarantees a tight worst-case ratio of 2.