Routing two-machine flowshop problems on networks with special structure

Routing two-machine flowshop problems on networks with special structure

0.00 Avg rating0 Votes
Article ID: iaor19971955
Country: United States
Volume: 30
Issue: 4
Start Page Number: 303
End Page Number: 314
Publication Date: Nov 1996
Journal: Transportation Science
Authors: ,
Keywords: vehicle routing & scheduling, scheduling
Abstract:

The authors 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 makeshpan given that the total distance traveled must be as small as possible. Properties of the problem are discussed, and algorithms with complexity O(nlogn) are developed for the problem on trees and cactuses.

Reviews

Required fields are marked *. Your email address will not be published.