EconPapers    
Economics at your fingertips  
 

A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem

C. O. Ozgur and J. R. Brown

Omega, 1995, vol. 23, issue 2, 205-219

Abstract: A scheduling method for a single machine scheduling problem with sequence dependent setup times is presented where similar products produced on the machine can be partitioned into families. A two-stage traveling salesman heuristic procedure is developed. In the first stage an n x n symmetric setup time matrix is generated for n products and the products are classified into families (groups) using either a hierarchical cluster analysis procedure or the users internal groupings. A Traveling Salesman Problem (TSP) is then solved to obtain an efficient sequence for each family. In the second stage, a special purpose traveling salesman heuristic is developed to combine the already sequenced families in an efficient way. The results of the computational study show that the Two-Stage Traveling Salesman procedure is approximately two to four times faster than the well known TSP heuristic by Lin and Kernighan, while the solution quality is comparable to Lin and Kernighan's heuristic. The paper also illustrates an industrial application of the procedure for an automated cable assembly machine.

Keywords: scheduling; Traveling; Salesman; Problem; sequence; dependent; setup; times; branch; and; bound (search for similar items in EconPapers)
Date: 1995
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(94)00057-H
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:23:y:1995:i:2:p:205-219

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:jomega:v:23:y:1995:i:2:p:205-219