An O ( n log n ) algorithm for the two-machine ow shop problem with controllable machine speeds

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.

MoreLess

Year of publication:	1995
Authors:	Hoesel, C.P.M. van ; Wagelmans, A.P.M. ; Vliet, M. van
Institutions:	Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization
Subject:	operations research and management science

More details

Extent:	application/pdf
Series:	Research Memoranda.
Type of publication:	Book / Working Paper
Language:	English
Notes:	The text is part of a series Research Memoranda Number 013
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005304803