| Article ID: | iaor20063356 |
| Country: | China |
| Volume: | 22 |
| Issue: | 2 |
| Start Page Number: | 177 |
| End Page Number: | 182 |
| Publication Date: | Jun 2005 |
| Journal: | Mathematics in Economics |
| Authors: | Lu Xuhua, Li Shougui |
| Keywords: | flowshop |
In an earlier article I have proved that an assembly flowshop scheduling problem is NP-complete and hence there exists no ‘good’ algorithm. In this paper, another heuristic algorithm is presented to find suboptimal solution and provided that the upper bounds of the performance ratio in the worst case for the heuristic algorithms are