Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints

European Journal of Operational Research

Volumn 171, Issue 1, 2006, Pages 107-122

  Lushchakova, Irene N ^a,b  

^a BELARUSIAN STATE UNIVERSITY OF INFORMATICS AND RADIOELECTRONICS   (Belarus)

^b INSTITUTE FOR MATHEMATICS   (Belarus)

Author keywords

Identical parallel machines; Open shop; Scheduling theory

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING;

IDENTICAL PARALLEL MACHINES; OPEN SHOP; SCHEDULING THEORY;

SCHEDULING;

EID: 28044469893     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.08.037     Document Type: Article

References (8)

1. P. Brucker, B. Jurisch, and M. Jurisch Open shop problems with unit time operations Zeitschrift für Operations Research-Methods and Models of Operations Research 37 1993 59 73
2. P. Brucker, S. Knust, Operations research: Complexity results of scheduling problems. Available from: < http://www.mathematik.uni-osnabrueck.de/research/OR/class/ >.
3. j Mathematical Methods of Operations Research 56 3 2003 407 412
4. H.N. Gabow, and O. Kariv Algorithms for edge coloring bipartite graphs and multigraphs SIAM Journal on Computing 11 1982 117 129
5. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic scheduling and sequencing: A survey Annals of Discrete Mathematics 5 1979 287 326
6. L.A. Herrbach, and J.Y.-T. Leung Preemptive scheduling of equal length jobs on two machines to minimize mean flow time Operations Research 38 1990 487 494
7. C.Y. Liu, and R.L. Bulfin Scheduling open shops with unit execution times to minimize functions of due dates Operations Research 36 1988 553 559
8. Mathematical methods for optimal scheduling in the systems with variable parameters and resource constraints, The technical report on the project BFBR Φ99-119, Minsk, 2002.