Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times. All these setups 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 result for parallel machine problem with a single and release times. New complexity results are derived for special cases.
展开▼
