A note on permutation flow shop problem

Annals of Operations Research

Volumn 129, Issue 1-4, 2004, Pages 247-252

  Sviridenko, M I ^a  

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

Author keywords

Approximation algorithms; Flow shop

Indexed keywords

EID: 3042800104     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000030691.65576.28     Document Type: Article

References (18)

1. Chen, B., C. Potts, and G. Woeginger. (1998). "A Review of Machine Scheduling: Complexity, Algorithms and Approximability." In D.-Z. Du and P.M. Pardalos (eds.), Handbook of Combinatorial Optimization, Vol. 3, pp. 21-169. Boston, MA: Kluwer Academic.
2. Conway, R., W. Maxwell, and L. Miller. (1967). Theory of Scheduling, Reading, MA: Addison-Wesley.
3. Czumaj, A. and C. Scheideler. (2000). "A New Algorithmic Approach to the General Lovasz Local Lemma with Applications to Scheduling and Satisfiability Problems." In Proc. 32 ACM Symposium on Theory of Computing (STOC).
4. Garey, M., D. Johnson, and R. Sethi. (1976). "The Complexity of Flowshop and Jobshop Scheduling." Math. Oper. Res. 1, 117-129.
5. Garg, N., S. Jain, and C. Swamy. (1999). "A Randomized Algorithm for Flow Shop Scheduling." In Proceedings of the FSTTCS'99. Lecture Notes in Computer Science, Vol. 1738.
6. Goldberg, L., M. Paterson, A. Srinivasan, and E. Sweedyk. (1997). "Better Approximation Guarantees for Job-Shop Scheduling." In Proc. of the 8th Symposium on Discrete Algorithms, pp. 599-608.
7. Hall, L. (1998). "Approximability of Flow Shop Scheduling." Math. Programming 82, 175-190.
8. Hofri, M. (1987). Probabilistic Analysis of Algorithms: On Computing Metodologies for Computing Algorithms Performance Evaluation. Springer.
9. Johnson, S. (1954). "Optimal Two- and Three-Stage Production Schedules with Setup Times Included." Naval Research Logistics Quarterly 1, 61-68.
10. Nowicki, E. and C. Smutnicki. (1989). "Worst-Case Analysis of an Approximation Algorithm for Flow-Shop Scheduling." Oper. Res. Lett. 8, 171-177.
11. Nowicki, E. and C. Smutnicki. (1991). "Worst-Case Analysis of Dannenbring's Algorithm for Flow-Shop Scheduling." Oper. Res. Lett. 10, 473-480.
12. Nowicki, E. and C. Smutnicki. (1993). "New Results in the Worst-Case Analysis for Flow-Shop Scheduling." Discrete Appl. Math. 46, 21-41.
13. Potts, C., D. Shmoys, and D. Williamson. (1991). "Permutation vs. Nonpermutation Flow Shop Schedules." Oper. Res. Lett. 10, 281-284.
14. Raghavan, P. (1988). "Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs." J. Comput. System Sci. 37, 130-143.
15. Röck, H. and G. Schmidt. (1983). "Machine Aggregation Heuristics in Shop-Scheduling." Methods Oper. Res. 45, 303-314.
16. Sevast'janov, S. (1995). "Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops." Math. Oper. Res. 20, 90-103.
17. Sevast'janov, S. (1994). "On Some Geometric Methods in Scheduling Theory: A Survey." Discrete Appl. Math. 55, 59-82.
18. Shmoys, D.B., C. Stein, and J. Wein. (1994). "Improved Approximation Algorithms for Shop Scheduling Problems." SIAM J. Comput. 23, 617-632.