Tight bounds for permutation flow shop scheduling

Mathematics of Operations Research

Volumn 34, Issue 2, 2009, Pages 417-427

  Nagarajan, Viswanath ^a   Sviridenko, Maxim ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Increasing subsequence; Shop scheduling

Indexed keywords

APPROXIMATION RATIOS; FIXED-ORDER; FLOW-SHOP; FLOW-SHOP SCHEDULING; INCREASING SUBSEQUENCE; INTEGRALITY GAPS; JOB COMPLETION; LINEAR PROGRAMMING RELAXATION; LONGEST INCREASING SUBSEQUENCES; LOWER BOUNDS; MACHINE LOADS; MAKESPAN; MAKESPAN OBJECTIVE; PERMUTATION FLOW SHOPS; PERMUTATION FLOW-SHOP SCHEDULING; PROCESSING TIME; SCHEDULING PROBLEM; SHOP SCHEDULING; TIGHT BOUND; TOTAL WEIGHTED COMPLETION TIME; WEIGHTED COMPLETION TIME; WORST-CASE ANALYSIS;

CONTROL THEORY; DYNAMIC PROGRAMMING; LINEARIZATION; MACHINE SHOP PRACTICE; OPTIMIZATION; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 67649991145     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0368     Document Type: Article

References (30)

1. Chakrabarti, S., C. Phillips, A. Schulz, D. Shmoys, C. Stein, J. Wein. 1996. Improved scheduling algorithms for Minsum Criteria. Proc. 23rd Internat. Colloquium on Automata, Languages, and Programming (ICALP), Springer, Berlin, 646-657.
2. Chazelle, B. 2000. The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge, UK.
3. Chen, B., C. Potts, G. Woeginger. 1998. A review of machine scheduling: Complexity, algorithms, and approximability, D.-Z. Du, P. M. Pardalos, eds. Handbook of Combinatorial Optimization, Vol. 3. Kluwer Academic Publishers, Boston, 21-169.
4. Conway, R., W. Maxwell, L. Miller. 1967. Theory of Scheduling. Addison-Wesley Publishing Co., Reading, MA.
5. Czumaj, A., C. Scheideler. 2000. A new algorithmic approach to the general lovasz local lemma with applications to schedulung and satisfiability problems. Proc. 32 ACM Sympos. Theory Comput (STOC). ACM Press, New York, 38-47.
6. Feige, U., C. Scheideler. 1998. Improved bounds for acyclic job shop scheduling. Proc. 30th Annual ACM Sympos. Theory Comput. (STOC), ACM Press, New York, 624-633.
7. Fishkin, A., K. Jansen, M. Mastrolilli. 2003. On minimizing average weighted completion time: A PTAS for the job shop problem with release dates. Algorithms and Computation. Lecture Notes in Comput. Set, Vol. 2906. Springer, Berlin, 319-328.
8. Framinan, J., J. Gupta, R. Leisten. 2004. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55 1243-1255.
9. Frieze, A. 1991. On the length of the longest monotone subsequence of a random permutation. Ann. Appl. Probab. 1(2) 301-305.
10. Hall, L. A., D. B. Shmoys, J. Wein. 1996. Scheduling to minimize average completion time: Off-line and on-line algorithms. Proc. 7th Sympos. Discrete Algorithms, ACM-SIAM, 142-151.
11. Hall, L. A., A. S. Schulz, D. B. Shmoys, J. Wein. 1997. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22 513-544.
12. Jansen, K., R. Solis-Oba, M. Sviridenko. 2003. Makespan minimization in job shops: A linear time approximation scheme. SIAM J. Discrete Math. 16 288-300.
13. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1993. Sequencing and scheduling: Algorithms and complexity. S. Graves, A. Rinnooy Kan, P. Zipkin, eds. Handbook in Operations Research and Management Science, Vol. 4. North-Holland, Amsterdam, 445-522.
14. Logan, B. F., L. A. Shepp. 1977. A variational problem for random young tableaux. Adv. Math. 26 206-222.
15. Nawaz, M., E. Enscore, Jr., I. Ham. 1983. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA Internat. J. Management Sci. 11 91-95.
16. Nowicki, E., C. Smutnicki. 1993. New results in the worst-case analysis for flow-shop scheduling. Discrete Appl. Math. 46 21-41.
17. Nowicki, E., C. Smutnicki. 1989. Worst-case analysis of an approximation algorithm for flow-shop scheduling. Oper. Res. Lett. 8 171-177.
18. Nowicki, E., C. Smutnicki. 1991. Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. Oper. Res. Lett. 10 473-480.
19. Potts, C., D. Shmoys, D. Williamson. 1991. Permutation vs. nonpermutation flow shop schedules. Oper. Res. Lett. 10 281-284.
20. Queyranne, M. 1993. Structure of a simple scheduling polyhedron. Math. Programming Ser. A 58(2) 263-285.
21. Queyranne, M., M. Sviridenko. 2002. Approximation algorithms for shop scheduling problems with minsum objective. J. Scheduling 5 287-305.
22. Raghavan, P. 1988. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. System Sci. 37 130-143.
23. Röck, H., G. Schmidt. 1983. Machine aggregation heuristics in shop-scheduling. Methods Oper. Res. 45 303-314.
24. Sevast'janov, S. 1994. On some geometric methods in scheduling theory: A survey. Discrete Appl. Math. 55 59-82.
25. Schrijver, A. 2003. Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics), Vol. 24(B). Springer-Verlag, Berlin.
26. Shmoys, D., C. Stein, J. Wein. 1994. Improved approximation algorithms for shop scheduling problems. SIAM J. Comput. 23(3) 617-632.
27. Smutnicki, C. 1998. Some results of the worst-case analysis for flow shop scheduling. Eur. J. Oper. Res. 109 66-87.
28. Sotelo, D., M. Poggi de Aragão. 2008. An approximation algorithm for the permutation flow shop scheduling problem via Erdõs-Szekeres Theorem Extensions. Working paper, Catholic University of Rio de Janeiro, Rio de Janeiro.
29. Sviridenko, M. 2004. A note on permutation flow shop problem. Ann. Oper. Res. 129 247-252.
30. Vershik, A. M., S. V Kerov. 1977. Asymptotics of the Plancherel measure of the symmetric group and the limit form of Young tableaux. Dokl. Akad. Nauk SSSR 233 1024-1027.