| Tài liệu tham khảo |
Loại |
Chi tiết |
| [12] N. Huynh Tuong and A. Soukhal, “Some new polynomial cases in just-in-time scheduling problems with multiple due dates,” 6th International conference on Re- search, Innovation and Vision for the Future in Computing and Communications Tech- nologies (RIVF’08), 2008, pp. 36-41 |
Sách, tạp chí |
| Tiêu đề: |
Some new polynomial cases in just-in-timescheduling problems with multiple due dates |
|
| [13] N. Huynh Tuong, “Complexité et algorithmes pour l’ordonnancement multicritère des travaux indépendants: problèmes juste-à-temps et travaux interférants,” Uni- versity of Tours, France, 2009 |
Sách, tạp chí |
| Tiêu đề: |
Complexité et algorithmes pour l’ordonnancement multicritèredes travaux indépendants: problèmes juste-à-temps et travaux interférants |
|
| [14] P. Brucker, “Scheduling algorithms”, 5th edition, Springer-Verlag, Berlin, Germany, 2007 |
Sách, tạp chí |
| Tiêu đề: |
Scheduling algorithms |
|
| [15] P. Baptiste, M. Flamini, and F. Sourd, “Lagrangian bounds for just-in-time job-shop scheduling,” Computers and Operations Research, vol. 35, no. 3, pp. 906-915, Mar.2008 |
Sách, tạp chí |
| Tiêu đề: |
Lagrangian bounds for just-in-time job-shopscheduling |
|
| [16] P. M. A. Soukhal, A. Oulamara, “Complexity of flow shop scheduling problems with transportation constraints,” European Journal of Operational Research, vol. 161, no.1, pp. 32-41, 2005 |
Sách, tạp chí |
| Tiêu đề: |
Complexity of flow shop scheduling problems withtransportation constraints |
|
| [17] 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, vol. 5, pp. 287–326, 1979 |
Sách, tạp chí |
| Tiêu đề: |
Optimization andapproximation in deterministic sequencing and scheduling: a survey |
|
| [18] S. Knust, “Complexity results for scheduling problems,” Internet:http://www.informatik.uni-osnabrueck.de/knust/class, Jun. 29, 2009 |
Sách, tạp chí |
| Tiêu đề: |
Complexity results for scheduling problems |
|
| [21] V. T kindt and J-C. Billaut, “Multicriteria scheduling : theory, models and algo- rithms”, Springer (2nd ed.), 2006 |
Sách, tạp chí |
| Tiêu đề: |
Multicriteria scheduling : theory, models and algo-rithms |
|
| [22] Y. Kergosien, C. Lenté, D. Piton, and J.-C. Billaut, “A tabu search heuristic for the dynamic transportation of patients between care units,” European Journal of Oper- ational Research, vol. 214, no. 2, pp. 442-452, Oct. 2011 |
Sách, tạp chí |
| Tiêu đề: |
A tabu search heuristic for thedynamic transportation of patients between care units |
|
| [23] A. Beloglazov, J. Abawajy and R. Buyya, “Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing,” Fu- ture Generation Computer Systems, , vol. 28, no. 5, pp. 755-768, 2012. DOI:10.1016/j.future.2011.04.017 |
Sách, tạp chí |
| Tiêu đề: |
Energy-aware resource allocationheuristics for efficient management of data centers for Cloud computing,” "Fu-ture Generation Computer Systems |
|
| [24] Garey M.R. et Johnson D.S. (1979). Computers and Intractability: A Guide to the The- ory of NP-Completeness. W.H. Freeman & Company, San Francisco |
Sách, tạp chí |
| Tiêu đề: |
Computers and Intractability: A Guide to the The-ory of NP-Completeness |
| Tác giả: |
Garey M.R. et Johnson D.S |
| Năm: |
1979 |
|
| [25] Í. Goiri, F. Julià, R. Nou, J. Berral, J. Guitart, and J. Torres, “Energy-aware Scheduling in Virtualized Datacenters,” IEEE International Conference on Cluster Computing (CLUSTER 2010), pp. 58–67, 2010 |
Sách, tạp chí |
| Tiêu đề: |
Energy-aware Schedulingin Virtualized Datacenters,” "IEEE International Conference on Cluster Computing(CLUSTER 2010) |
|
| [26] B. Speitkamp and M. Bichler, “A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers,” IEEE Transactions on Ser- vices Computing, 3 (4) pp. 266–278, 2010 |
Sách, tạp chí |
| Tiêu đề: |
A Mathematical Programming Approach for ServerConsolidation Problems in Virtualized Data Centers,” "IEEE Transactions on Ser-vices Computing |
|
| [27] Chandra Chekuri, S. Khanna, “On Multi-Dimensional Packing Problems,” SODA 1999, pp. 185–194, 1999 |
Sách, tạp chí |
| Tiêu đề: |
On Multi-Dimensional Packing Problems,” "SODA1999 |
|
| [28] R. Panigrahy, K. Talwar, and L. Uyeda, “Heuristics for Vector Bin Packing,” re- search.microsoft.com, 2011 |
Sách, tạp chí |
| Tiêu đề: |
Heuristics for Vector Bin Packing,” "re-search.microsoft.com |
|
| [29] B. Sotomayor, K. Keahey, and I. Foster, “Combining batch execution and leas- ing using virtual machines,” HPDC ’08 Proceedings of the 17th international symposium on High performance distributed computing, pp. 87–96, 2008. DOI:10.1145/1383422.1383434 |
Sách, tạp chí |
| Tiêu đề: |
Combining batch execution and leas-ing using virtual machines,” "HPDC ’08 Proceedings of the 17th internationalsymposium on High performance distributed computing |
|
| [30] B. Sotomayor, “Provisioning Computational Resources Using Virtual Machines and Leases,” PhD Thesis submited to The University of Chicago. US, 2010 |
Sách, tạp chí |
| Tiêu đề: |
Provisioning Computational Resources Using Virtual Machinesand Leases,”"PhD Thesis submited to The University of Chicago. US |
|
| [31] N. Q. Hung, N. Thoai, and N. T. Son, “Performance constraint and power-aware allocation for user requests in virtual computing lab,” Journal of Science and Tech- nology (Vietnam), vol. 49, 4A, no. Special on Int. Conf. on Advanced Computing and Applications (ACOMP2011), pp. 383–392, 2011 |
Sách, tạp chí |
| Tiêu đề: |
Performance constraint and power-awareallocation for user requests in virtual computing lab,”"Journal of Science and Tech-nology (Vietnam), vol. 49, 4A, no. Special on Int. Conf. on Advanced Computing andApplications (ACOMP2011) |
|
| [32] J. R. Correa and M. R. Wagner, “LP-based online scheduling : from single to parallel machines,” Math. Program., Ser. A (2009), vol. 119, pp. 109–136, 2009 |
Sách, tạp chí |
| Tiêu đề: |
LP-based online scheduling : from single to parallelmachines,”"Math. Program., Ser. A (2009) |
| Tác giả: |
J. R. Correa and M. R. Wagner, “LP-based online scheduling : from single to parallel machines,” Math. Program., Ser. A |
| Năm: |
2009 |
|
| [33] A. Schulz, “Scheduling unrelated machines by randomized rounding,” SIAM Jour- nal on Discrete Mathematics, vol. 15, no. 4, p. 450, 2002 |
Sách, tạp chí |
| Tiêu đề: |
Scheduling unrelated machines by randomized rounding,”"SIAM Jour-nal on Discrete Mathematics |
|