Routing Two-Machine Flowshop Problems on Networks with Special Structure

Igor Averbakh and Oded Berman
Additional contact information
Igor Averbakh: Department of Mathematics, Western Washington University, Bellingham, Washington 98225
Oded Berman: Faculty of Management, University of Toronto, Toronto, Ontario M5S 1V4, Canada

Transportation Science, 1996, vol. 30, issue 4, 303-314

Abstract: We consider a version of the routing two-machine flowshop problem, where n jobs located at different nodes of a transportation network must be executed by two machines traveling between the jobs. Each job must be processed by both machines in the order, machine 1 first, machine 2 second. The goal is to minimize the makespan given that the total distance traveled must be as small as possible. Properties of the problem are discussed, and algorithms with complexity O ( n log n ) are developed for the problem on trees and cactuses.

Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.4.303 (application/pdf)

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:inm:ortrsc:v:30:y:1996:i:4:p:303-314

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().