Bounds for the cardinality constrained P∥Cmax problem

Journal of Scheduling

Volumn 4, Issue 3, 2001, Pages 123-138

  Dell'Amico, Mauro ^a,c   Martello, Silvano ^b  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c DISMI   (Italy)

Author keywords

Cardinality constraints; Lower bounds; Parallel machines; Scheduling

Indexed keywords

EID: 0345621482     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.68     Document Type: Article

References (8)

1. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 1979; 5:287-326.
2. Babel L, Kellerer H, Kotov V. The k-partitioning problem. Mathematical Methods of Operations Research 1998; 47:59-82.
3. Dell'Amico M, Martello S. Optimal scheduling of tasks on identical parallel processors. ORS A Journal on Computing 1995; 7:191-200.
4. Graham RL. Bounds for certain multiprocessing anomalies. Bell System Technical Journal 1966; 45:1563-1581.
5. Graham RL. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 1969; 17:416-429.
6. Martello S, Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 1990; 28:59-70.
7. Martello S, Toth P. Knapsack Problems: Algorithms and Computer Implementations. Wiley: Chichester, 1990.
8. Labbé M, Laporte G, Mercure H. Capacitated vehicle routing on trees. Operations Research 1991; 39:616-622.