Parallel machine problems with a single server and release times
Tóm tắt
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.
Tài liệu tham khảo
Hall N, Potts C, Sriskandarajah C (2000) Parallel machine scheduling with a common server.Discrete Applied Math, 102:223–243
Kravchenko S K, Werner F (1997) Parallel machine scheduling problems with a single server.Mathematical and Computer Modelling, 26(12):1–11
Garey M R, Johnson D S (1997) Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman.