no. 1
A new formulation for scheduling unrelated processor under precedence constraints
RAIRO - Operations Research - Recherche Opérationnelle, Tome 33 (1999) no. 1, pp. 87-92 
@article{RO_1999__33_1_87_0,
     author = {Maculan, Nelson and Porto, Stella C. S. and Ribeiro, Celso C. and Carvalho de Souza, Cid},
     title = {A new formulation for scheduling unrelated processor under precedence constraints},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {87--92},
     year = {1999},
     publisher = {EDP Sciences},
     volume = {33},
     number = {1},
     mrnumber = {1717005},
     zbl = {0958.90046},
     language = {en},
     url = {https://www.numdam.org/item/RO_1999__33_1_87_0/}
}
TY  - JOUR
AU  - Maculan, Nelson
AU  - Porto, Stella C. S.
AU  - Ribeiro, Celso C.
AU  - Carvalho de Souza, Cid
TI  - A new formulation for scheduling unrelated processor under precedence constraints
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1999
SP  - 87
EP  - 92
VL  - 33
IS  - 1
PB  - EDP Sciences
UR  - https://www.numdam.org/item/RO_1999__33_1_87_0/
LA  - en
ID  - RO_1999__33_1_87_0
ER  - 
%0 Journal Article
%A Maculan, Nelson
%A Porto, Stella C. S.
%A Ribeiro, Celso C.
%A Carvalho de Souza, Cid
%T A new formulation for scheduling unrelated processor under precedence constraints
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1999
%P 87-92
%V 33
%N 1
%I EDP Sciences
%U https://www.numdam.org/item/RO_1999__33_1_87_0/
%G en
%F RO_1999__33_1_87_0
Maculan, Nelson; Porto, Stella C. S.; Ribeiro, Celso C.; Carvalho de Souza, Cid. A new formulation for scheduling unrelated processor under precedence constraints. RAIRO - Operations Research - Recherche Opérationnelle, Tome 33 (1999) no. 1, pp. 87-92. https://www.numdam.org/item/RO_1999__33_1_87_0/

1. D. P. Bertsekas and J. N Tsitsiklis, Parallel and Distributed Computation, Prentice-Hall, Englewood Cliffs, 1989. | Zbl

2. J. Blazewicz, Personnal communication, 1993.

3. J. Blazewicz, W. Cellary, R. Slowinski and J. Weglarz, Scheduling Under Resource Constraints - Deterministic Models, J.C. Baltzer AG, Basel 1986. | Zbl

4. E. G. Coffman and P. J. Denning, Operating Systems Theory, Prentice-Hall Inc., New Jersey, 1973.

5. M. R. Garey and D. S. Johnson, Strong NP-Completeness Results: Motivation, Examples and Implications, Journal of the ACM 25, 1978, pp. 499-508. | Zbl | MR

6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979. | Zbl | MR

7. J.-B. Lasserre and M. Queyranne, Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single Machine Scheduling, in Proceedings of the II Integer Programming and Combinatorial Optimization Conference (E. Balas, G. Cornuejols, and R. Kannan, eds.), pp. 136-149.

8. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, Sequencing and Scheduling: Algorithms and Complexity, Report NFI 11.89/03, Eindhoven Institute of Technology, Department of Mathematics and Computer Science, Eindhoven, 1989.

9. D. A. Menascé and S. C. S. Porto, Processor Assignment in Heterogeneous Parallel Architectures, Proceedings of the IEEE International Parallel Processing Symposium, pp. 186-191, Beverly Hills, 1992.

10. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, John Wiley and Sons, 1988. | Zbl | MR

11. S. C. Porto and C. C. Ribeiro, A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints, International Journal of High Speed Computing 7, 1995, pp. 45-71.

12. S. C. Porto and C. C. Ribeiro, Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints, Journal of Heuristics 1, 1995, pp. 207-223. | Zbl

13. M. Queyranne and A. Schulz, Polyhedral Approaches to Machine Scheduling, Report 1994-408, Technical University of Berlin, 1994.