A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness

European Journal of Operational Research

Volumn 103, Issue 1, 1997, Pages 113-116

  Gladky, A A ^a  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Mean flow time; NP hardness; Preemptive openshop scheduling

Indexed keywords

JOB ANALYSIS; OPTIMIZATION; PLANNING; PROCESS ENGINEERING; SHOPPING CENTERS;

OPENSHOP SYSTEMS;

SCHEDULING;

EID: 0031272669     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00249-4     Document Type: Article

References (3)

1. Garey M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
2. Graham, R.L., Lawner, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., "Optimization and approximation in deterministic sequencing and scheduling: A survey", Annals of Discrete Mathematics 5 (1979) 287-326.
3. Sriskandarajah, C., and Wagneur, E., "On the complexity of preemptive openshop scheduling problems", European Journal of Operational Research 77 (1994) 404-414.