Order scheduling models: Hardness and algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4855 LNCS, Issue , 2007, Pages 96-107

  Garg, Naveen ^a   Kumar, Amit ^a   Pandit, Vinayaka ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b IBM RESEARCH INDIA   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; ONLINE SYSTEMS; PROBLEM SOLVING;

OFFLINE SETTING; ONLINE ALGORITHMS;

SCHEDULING;

EID: 38349071579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77050-3_8     Document Type: Conference Paper

References (20)

1. Abramson, D., Sosic, R., Giddy, J., Hall, B.: Nimrod: A tool for performing parameterised simulations using distributed applications. In: Proceedings of the 4th IEEE Symposium on High Performance Distributed Computing, IEEE Computer Society Press, Los Alamitos (1995)
2. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: FOCS, pp. 32-44 (1999)
3. Awerbuch, B., Azar, Y., Leonardi, S., Regev, O.: Minimizing the flow time without migration. In: ACM Symposium on Theory of Computing (STOC), pp. 198-205 (1999)
4. Brixius, N., Linderoth, J., Goux, J.: Solving large quadratic assignment problems on computational grid. Mathematical Programming, Series B 91, 563-588 (2002)
5. Chakrabarti, S., Phillips, C., Schulz, A., Shmoys, D., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: Proc. of the 23rd Int. Colloquium on Automata, Languages and Programming, pp. 646-657 (1996)
6. Chen, Z., Hall, N.: Supply chain scheduling: Assembly systems. Technical report, The Ohio State University (2000)
7. Gandhi, R., Halldorsson, M., Kortsarz, G., Shachnai, H.: Improved results for data migration and open shop scheduling. In: Proc. of the 31st Int. Colloquium on Automata, Languages, and Programming, pp. 658-669 (2004)
8. Goux, J., Kulkarni, S., Linderoth, J., Yoder, M.: Master-worker: An enabling framework for applications on the computational grids. In: Proceedings of the 9th IEEE Symposium on High Performance Distributed Computing, pp. 43-50 (2000)
9. Hall, L., Schulz, A., Shmoys, D., Wein, J.: Scheduling to minimize average completion time: offline and online algorithms. Mathematics of Operations Research 22, 513-549 (1997)
10. Hoogeveen, H., Schuurman, P., Woeginger, G.: Non-approximability results for scheduling problems with minsum criteria. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 1412, pp. 353-362. Springer, Heidelberg (1998)
11. Leung, J., Li, H., Pindeo, M.: Multidisciplinery scheduling: Theory and Applications, chapter Order Scheduling Models: an overview, 37-56 (2005)
12. Linderoth, J., Wright, S.: Decomposition algorithms for stochastic programming on a computational grid. Computational Optimization and Applications 24, 207-250 (2003)
13. Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425-440 (1991)
14. Queyranne, M.: Structure of a simple scheduling polyhedron. Mathematical Programming 58, 263-285 (1993)
15. Queyranne, M., Svirdenko, M.: New and improved algorithms for minsum shop scheduling. In: Symposium on Discrete Algorithms, pp. 871-878 (2000)
16. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: ACM Symposium on Theory of Computing (STOC), pp. 475-484 (1997)
17. Roemer, T.: A note on the complexity of the concurrent open shop problem. Journal of scheduling 9, 389-396 (2006)
18. Schulz, A.: Scheduling to minimize total weighted completion time: Performance guarantees of lp-based heuristics and lower bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 1084, pp. 301-315. Springer, Heidelberg (1996)
19. Wagneur, E., Sriskandarajah, C.: Open shops with jobs overlap. European Journal of Operations Research 71, 366-378 (1993)
20. Wang, G., Cheng, T.: Customer order scheduling to minimize total weighted completion time. Omega 35, 623-626 (2007)