Scheduling tasks with exponential duration on unrelated parallel machines

Discrete Applied Mathematics

Volumn 160, Issue 16-17, 2012, Pages 2462-2473

  Nouri, Mostafa ^a   Ghodsi, Mohammad ^b  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b INSTITUTE FOR RESEARCH IN FUNDAMENTAL SCIENCES IPM   (Iran)

Author keywords

Multiple choice hyperbolic 01 programming; Stochastic parallel scheduling

Indexed keywords

0-1 PROGRAMMING; DIRECTED ACYCLIC GRAPH (DAG); EXPECTED TIME; NEGATIVE EXPONENTIAL DISTRIBUTION; NP-HARD; OPTIMUM SCHEDULE; PARALLEL SCHEDULING; POLYNOMIAL-TIME; PRECEDENCE RELATIONS; SCHEDULING TASKS; STOCHASTIC SCHEDULING; UNRELATED PARALLEL MACHINES;

POLYNOMIAL APPROXIMATION; STOCHASTIC SYSTEMS;

SCHEDULING;

EID: 84865086469     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2012.06.010     Document Type: Article

References (25)

1. P. Brucker Scheduling Algorithms fifth ed. 2007 Springer
2. J. Bruno, P. Downey, and G.N. Frederickson Sequencing tasks with exponential service times to minimize the expected flow time or makespan Journal of the ACM 28 1981 100 113
3. T.H. Cormen, C. Stein, R.L. Rivest, and C.E. Leiserson Introduction to Algorithms 2001 McGraw-Hill Higher Education
4. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars Computational Geometry: Algorithms and Applications third ed. 2008 Springer
5. R.P. Dilworth A decomposition theorem for partially ordered sets Annals of Mathematics 51 1950 161 168
6. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 4 1979 287 326
7. P.L. Hammer, and S. Rudeanu Boolean Methods in Operations Research and Related Areas 1968 Springer-Verlag Berlin, Heidelberg, New York
8. P. Hansen, M.V.P. de Arago, and C.C. Ribeiro Hyperbolic 01 programming and query optimization in information retrieval Mathematical Programming 52 2 1991 255 263 (Pubitemid 21692148)
9. W. Herroelen, and R. Leus Project scheduling under uncertainty: Survey and research potentials European Journal of Operational Research 165 2 2005 289 306 (Pubitemid 40206362)
10. T.C. Hu Parallel sequencing and assembly line problems Operations Research 9 1961 841 848
11. J.K. Lenstra, and A.H.G. Rinnooy Kan Complexity of scheduling under precedence constraints Operations Research 26 1 1978 22 35
12. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problem Annals of Discrete Mathematics 1 1997 North-Holland Amsterdam 343 362
13. G. Lin, R. Rajaraman, Approximation algorithms for multiprocessor scheduling under uncertainty, in: SPAA'07: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, New York, NY, USA, 2007, pp. 2534. (Pubitemid 47568552)
14. G. Malewicz, Parallel scheduling of complex dags under uncertainty, in: SPAA'05: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, New York, NY, USA, 2005, pp. 6675. (Pubitemid 43206553)
15. R.H. Mhring Computationally tractable classes of ordered sets Algorithms and Order 1989 105 193
16. M.L. Pinedo Scheduling: Theory, Algorithms, and Systems third ed. 2008 Springer Publishing Company, Incorporated
17. M. Pinedo, and G. Weiss Scheduling of stochastic tasks on two parallel processors Naval Research Logistics Quarterly 26 3 1979 527 535 (Pubitemid 10420958)
18. O.A. Prokopyev, H.-X. Huang, and P.M. Pardalos On complexity of unconstrained hyperbolic 01 programming problems Operations Research Letters 33 3 2005 312 318
19. O.A. Prokopyev, C.N. Meneses, C.A.S. Oliveira, and P.M. Pardalos On multiple-ratio hyperbolic 01 programming problems Pacific Journal of Optimization 1 2 2005 327 345
20. P. Robillard (0, 1 ) hyperbolic programming problems Naval Research Logistics Quarterly 18 1 1971 47 57
21. J.D. Ullman NP-complete scheduling problems Journal of Computer and System Sciences 10 1975 384 393
22. L. Van Der Heyden Scheduling jobs with exponential processing and arrival times on identical processors so as to minimize the expected makespan Mathematics of Operations Research 6 2 1981 305 312
23. B. Veltman, Multiprocessor scheduling with communication delays. Ph.D. Thesis, Eindhoven University of Technology, 1993.
24. R.R. Weber Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime Journal of Applied Probability 19 1982 167 182
25. G. Weiss, and M. Pinedo Scheduling tasks with exponential service times on nonidentical processors to minimize various cost functions Journal of Applied Probability 17 1980 187 202