Parallel machine scheduling problems with a single server

Mathematical and Computer Modelling

Volumn 26, Issue 12, 1997, Pages 1-11

  Kravchenko, S A ^a   Werner, F ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Heuristics; NP hard problems; Parallel machine problems; Polynomial algorithms; Production scheduling; Setup times

Indexed keywords

COMPUTER NETWORKS; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

PRODUCTION SCHEDULING; PSEUDOPOLYNOMIAL ALGORITHM;

ALGORITHMS;

EID: 0031469437     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(97)00236-7     Document Type: Article

References (5)

1. N.G. Hall, C.N. Potts and C. Sriskandarajah, Parallel machine scheduling with a common server, In The Fifth International Workshop on Project Management and Scheduling, Abstracts, pp. 102-106, (1996).
2. C.P. Koulamas, Scheduling two parallel semiautomatic machines to minimize machine interference, Computers and Operations Research 23 (10), 945-956 (1996).
3. G. Dobson and U.S. Karmarkar, Simultaneous resource scheduling to minimize weighted flow times, Operations Res. 37, 1523-1533 (1988).
4. V.K. Sahney, Single-server, two-machine sequencing with switching time, Operations Res. 20, 24-26 (1972).
5. V.S. Tanaev, V.S. Gordon and Y.M. Shafransky, Scheduling Theory, Single-Stage Systems, Kluwer Academic, (1994).