One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
Kybernetika, Tome 23 (1987) no. 4, pp. 289-293 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 90B35
@article{KYB_1987_23_4_a1,
     author = {Janiak, Adam},
     title = {One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints},
     journal = {Kybernetika},
     pages = {289--293},
     year = {1987},
     volume = {23},
     number = {4},
     mrnumber = {912013},
     zbl = {0635.90048},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1987_23_4_a1/}
}
TY  - JOUR
AU  - Janiak, Adam
TI  - One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
JO  - Kybernetika
PY  - 1987
SP  - 289
EP  - 293
VL  - 23
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/KYB_1987_23_4_a1/
LA  - en
ID  - KYB_1987_23_4_a1
ER  - 
%0 Journal Article
%A Janiak, Adam
%T One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
%J Kybernetika
%D 1987
%P 289-293
%V 23
%N 4
%U http://geodesic.mathdoc.fr/item/KYB_1987_23_4_a1/
%G en
%F KYB_1987_23_4_a1
Janiak, Adam. One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika, Tome 23 (1987) no. 4, pp. 289-293. http://geodesic.mathdoc.fr/item/KYB_1987_23_4_a1/

[1] J. R. Jackson: Scheduling a Production Line to Minimize Maximum Tardiness. Research Report, University of California at Los Angeles 1955.

[2] L. Lawler: Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19 (1973), 544-546.

[3] H. L. Lawler J. K. Lenstra, A. H. G. Rinnooy Kan: Recent developments in deterministic sequencing and scheduling: a survey. In: Deterministic and Stochastic Scheduling, (M. A. H. Dempster, J. K. Lenstra and A. H. G. Rinnooy Kan, eds.), Dordrecht 1982.