Template-type: ReDif-Paper 1.0
Author-Name: Hoesel C.P.M. van
Author-Name: Wagelmans A.P.M.
Author-Name: Vliet M. van
Author-workplace-name: METEOR
Title: An O ( n log n ) algorithm for the two-machine ow shop problem with controllable machine speeds
Abstract: In this paper we consider the two-machine ow shop problem with varying machine speeds. We present an algorithm which determines the optimal permutations for all machine speeds in O ( n log n ) time, where n is the number of jobs. To achieve this bound on the running time, the algorithm employs an elementary dominance relation. Key words: Scheduling, Flow Shop, Algorithm Analysis, Controllable Machine Speeds. 
Keywords: operations research and management science; 
Series: Research Memoranda
Creation-Date: 1995
Number: 013
File-URL: http://digitalarchive.maastrichtuniversity.nl/fedora/objects/guid:896ea0b6-e607-4391-a7dc-f57263023f2a/datastreams/ASSET1/content
File-Format: application/pdf
File-Size: 223589
Handle: RePEc:unm:umamet:1995013