The complexity of shop-scheduling problems with two or three jobs

European Journal of Operational Research

Volumn 53, Issue 3, 1991, Pages 326-336

  Sotskov, Yu N ^a  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

NP hard problem; optimal makespan schedule; optimal mean flow time schedule; Optimization; regular criterion

Indexed keywords

MATHEMATICAL TECHNIQUES - ALGORITHMS; PRODUCTION CONTROL - OPERATIONS RESEARCH; SCHEDULING - OPTIMIZATION;

MEAN FLOW TIME SCHEDULE; SHOP SCHEDULING PROBLEMS;

PRODUCTION CONTROL;

EID: 0026204971     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(91)90066-5     Document Type: Article

References (13)

1. An efficient algorithm for the job-shop problem with two jobs
2. Open Shop Scheduling to Minimize Finish Time
3. A Geometric Model and a Graphical Algorithm for a Sequencing Problem
4. Complexity of machine scheduling problems
5. Sequencing by Enumerative Methods
6. Optimal scheduling two jobs with regular criterion
7. The complexity of scheduling problems with fixed number of jobs
8. Solution of the Akers-Friedman Scheduling Problem
9. Theory of Scheduling, One-stage systems
10. Theory of Scheduling, Multi-stage systems