| Article ID: | iaor19961185 |
| Country: | Netherlands |
| Volume: | 66 |
| Issue: | 1 |
| Start Page Number: | 65 |
| End Page Number: | 71 |
| Publication Date: | Apr 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Selim Shokri Z., Al-Haboubi Mohamad |
| Keywords: | programming: travelling salesman |
The problem of sequencing jobs on a weaving machine is considered where set-up costs are included. The structure of the set-up cost is utilized to develop a polynomial time solution algorithm. The algorithm involves computing the shortest path of a network. An example is solved.