A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness

Journal of Scheduling

Volumn 6, Issue 4, 2003, Pages 395-404

  Baptiste, Philippe ^a   Schieber, Baruch ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Linear programming; Multiprocessor task scheduling; Unit processing times

Indexed keywords

COMBINATORIAL ALGORITHMS; MULTIPROCESSOR TASK SCHEDULING; UNIT PROCESSING TIMES;

ALGORITHMS; COMBINATORIAL MATHEMATICS; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS;

SCHEDULING;

EID: 3543090960     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024012811536     Document Type: Article

References (4)

1. Blazewicz, J., K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, 1996.
2. Brucker, P., Scheduling Algorithms, 3rd edn, Springer, 2001.
3. Brucker, P., and A. Krämer, "Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems," Eur. J. Oper. Res., 90, 214-226 (1996).
4. Lloyd, E. L., "Concurrent task systems," Oper. Res., 29, 189-201 (1981).