Minimizing the number of machines for scheduling jobs with equal processing times

European Journal of Operational Research

Volumn 199, Issue 2, 2009, Pages 595-600

  Kravchenko, Svetlana A ^a   Werner, Frank ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Linear programming; Parallel machine scheduling

Indexed keywords

FEASIBLE SCHEDULES; PARALLEL MACHINE SCHEDULING; PARALLEL MACHINES; POLYNOMIAL ALGORITHMS; PROCESSING TIME; RELEASE DATES; SCHEDULING JOBS;

DYNAMIC PROGRAMMING; LINEARIZATION; MACHINERY; PARTICLE SIZE ANALYSIS;

OPTIMIZATION;

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

References (7)

1. Brucker P., and Kravchenko S.A. Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling 11 (2008) 229-237
2. P. Brucker, S.A. Kravchenko, Scheduling Jobs with Release Times on Parallel Machines to Minimize Total Tardiness, OSM Reihe P, Heft 258, Universität Osnabrück, Fachbereich Mathematik/Informatik, 2005.
3. Dantzig G.B., and Fulkerson D.R. Minimizing the number of tankers to meet a fixed schedule. Naval Research Logistics Quarterly 1 (1954) 217-222
4. Finke G., Lemaire P., Proth J.-M., and Queyranne M. Minimizing the number of machines for minimum-length schedules. European Journal of Operational Research (2008) 10.1016/j.ejor.2006.11.050
5. Kroon L.G., Salomon M., and van Wassenhove L.N. Exact and approximation algorithms for the tactical fixed interval scheduling problem. Operations Research 45 4 (1997) 624-638
6. Moukrim A. On the minimum number of processors for scheduling problems with communication delays. Annals of Operations Research 86 (1999) 455-472
7. Simons B.B., and Warmuth M.K. A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing 18 (1989) 690-710