| Article ID: | iaor199799 |
| Country: | Netherlands |
| Volume: | 17 |
| Issue: | 4 |
| Start Page Number: | 159 |
| End Page Number: | 164 |
| Publication Date: | May 1995 |
| Journal: | Operations Research Letters |
| Authors: | Mathur Kamlesh, Emmons Hamilton |
| Keywords: | programming: travelling salesman |
The authors consider a no-wait flow shop which manufactures large numbers of copies of a few basic job types. After observing that a no-wait flow sop can be modeled as a traveling salesman problem, the authors present some results which can be used to reduce the size of the problem. Further results frequently allow us to quickly generate an optimal sequence for a set of jobs, based on the know solution to a subset or superset of these jobs.