A priori parallel machines scheduling

Computers and Industrial Engineering

Volumn 58, Issue 3, 2010, Pages 488-500

  Bouyahia, Zied ^a   Bellalouna, Monia ^a   Jaillet, Patrick ^b   Ghedira, Khaled ^a  

^a LI3 laboratory   (Tunisia)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

A priori scheduling; Parallel machines; Robust method; Total weighted flow time

Indexed keywords

A PRIORI SCHEDULING; APRIORI; FLOW-TIME; PARALLEL MACHINE; ROBUST METHODS;

COMPUTATIONAL COMPLEXITY; PROBABILITY; SCHEDULING;

PARALLEL FLOW;

EID: 77949658319     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2009.11.009     Document Type: Article

References (35)

1. Anderson E.J., and Potts C.N. On-line scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research 29 (2004) 686-697
2. Baev I.D., Meleis W.M., and Eichenberger A. An experimental study of algorithms for weighted completion time scheduling. Algorithmica 33 (2002) 34-51
3. Becchetti L., and Leonardi S. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. Journal of the ACM 51 (2004) 517-539
4. Bellalouna, M. (1993). Problèmes d'optimization combinatoires probabilistes, Ph.D. Thesis, Centre de Mathématiques Appliquées, ENPC, France.
5. Bellalouna M., Murat C., and Paschos V. Probabilistic combinatorial optimization on graphs: A new domain in operational research. European Journal of Operational Research 87 (1995) 693-706
6. Bellalouna M., Souissi S., and Ycart B. Average case analysis for the probabilistic bin packing problem. Trends in mathematics (2004), Birkhasern Verlag Basel, Switzerland 149-159
7. Berman O., Jaillet P., and Simchi-Levi D. Recent developments in location-routing problems with uncertainty. In: Drezner Z. (Ed). Facility location: A survey of applications and methods (1995), Springer, New York
8. Bertsimas, D. (1988). Probabilistic combinatorial optimization problems, Technical Report 194, Operations Research Center, MIT.
9. Bertsimas D., Jaillet P., and Odoni A. A priori optimization. Operations Research 38 (1990) 1019-1033
10. Bianchi L., Gambardella L., and Dorigo M. An ant colony optimization approach to the probabilistic traveling salesman problem. Lecture Notes in Computer Science 2439 (2002) 883-892
11. Conway R., Maxwel W., and Miller L. Theory of scheduling (1970), Addision-Wesley, Reading, Massachusetts
12. Eastman W., Even S., and Isaacs I. Bounds for the optimal scheduling of n jobs on m processors. Management Science 11 (1964) 268-297
13. Glazebrook K. Scheduling tasks with exponential service times on parallel processors. Journal of Applied Probability 16 (1979) 685-689
14. Graham R.L., Lawler E.L., Lenstra J.K., and Kan A.H.G.R. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
15. Hall N.G., and Potts C.N. Rescheduling for new orders. Operations Research 52 3 (2004) 440-453 10.1287/opre.1030.0101
16. Horn W. Minimizing average flow time with parallel machines. Operations Research 21 (1973) 846-847
17. Jaillet, P. (1985). The probabilistic traveling salesman problems, Technical Report 185, Operations Research Center, MIT.
18. Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research 36 (1988) 929-936
19. Laporte G., Louveaux F., and Mercure H. An exact solution for the a priori optimization of the probabilistic traveling salesman problem. Operationas Research 42 (1994) 543-549
20. Lawler E. Recent results in the theory of machine scheduling. In: Bachem A., Grötchel M., and Korte B. (Eds). Mathematical programming: The state of the art (1983), Springer, Berlin
21. Lawler E., Lenstra J., and Kan A.R. Recent developments in deterministic sequencing and scheduling. In: Dempster M., Lenstra J., and Kan A.R. (Eds). Deterministic and stochastic scheduling (1982), Reidel, Dordrecht
22. Lawler E., Lenstra J., Kan A.R., and Shmoys D. Sequencing and scheduling: Algorithms and complexity. In: Graves S., Kan A.R., and Zipkin P. (Eds). Handbooks in operations research and management science Vol. 4 (1993), Logistics of Production and Inventory, North Holland 445-522
23. Lenstra J., and Kan A.R. Sequencing and scheduling. In: Lenstra J., and Kan A.R. (Eds). Combinatorial optimization: Annotated bibliographies (1985), Wiley, Chichester
24. Lenstra J., Kan A.R., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
25. Leung J.Y.-T. Handbook of scheduling: Algorithms, models, and performance analysis, Chapman & Hall / CRC computer and information science series (2004), Chapman & Hall/CRC, Boca Raton, FL
26. Megow N., and Schulz A.S. On-line scheduling to minimize average completion time revisited. Operations Research Letters 32 (2004) 485-490
27. Möhring R.H., Radermacher F.J., and Weiss G. Stochastic scheduling problems II: Set strategies. ZOR - Zeitschrift für Operations Research A 29 (1985) 65-104
28. Pinedo M. On the computational complexity of stochastic scheduling problems. In: Dempster M., Lenstra J., and Kan A.R. (Eds). Deterministic and stochastic scheduling (1982), Reidel, Dordrecht
29. Pinedo M. Scheduling: Theory, algorithms and systems (1995), Prentice Hall
30. Pinedo M., and Schrage L. Stochastic shop scheduling: A survey. In: Dempster M., Lenstra J., and Kan A.R. (Eds). Deterministic and stochastic scheduling (1982), Reidel, Dordrecht
31. Powell W., Jaillet P., and Odoni A. Stochastic and dynamic routing and networks. Handbook of Operations Research 8 (1995) 141-295
32. Skutella M., and Uetz M. Stochastic machine scheduling with precedence constraints. SIAM Journal on Computing 34 (2005) 788-802
33. Skutella M., and Woeginger G. A PTAS for minimizing the total weighted completion time on identical parallel machines. Mathematics of Operations Research 25 (2000) 63-75
34. Smith W.E. Various optimizers for single-stage production. Naval Research Logistics Quarterly 3 (1956) 59-66
35. Webster S. New bounds for the identical parallel processor weighted flow time problem. Management Science 38 (1992) 124-136