Research Article
Complexity results for parallel machine problems with a single server
Abstract
Parallel machine problems with a single server are generalizations of classical parallel machine problems. Immediately before processing, each job must be loaded on a machine, which takes a certain set-up time. All these set-ups have to be done by a single server which can handle at most one job at a time. In this paper we continue studying the complexity aspects of server problems begun in Hall et al. (Discrete Appl. Math. 2000; 102: 223) and Kravchenko and Werner (Math. Comput. Model. 1997; 26: 1). New complexity results are derived for special cases. Copyright © 2002 John Wiley & Sons, Ltd.
