Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem

Operations Research

Volumn 46, Issue 6, 1998, Pages 872-882

  Kaminsky, Philip ^a   Simchi Levi, David ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Analysis of algorithm: probabilistic analysis; Production scheduling, multiple machine sequencing: flow shop weighted completion time problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILITY; PROBLEM SOLVING; SCHEDULING; TIME AND MOTION STUDY;

FLOW SHOP WEIGHTED COMPLETION TIME PROBLEM; PROFILE FITTING HEURISTIC; WEIGHTED SHORTEST PROCESSING TIME;

OPERATIONS RESEARCH;

EID: 0032201667     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.6.872     Document Type: Article

References (23)

1. ADIR, I. AND N. AMIT. 1984. Openshop and Flowshop Scheduling to Minimize Sum of Completion Times. Comput. Opns. Res. 11, 275-284.
2. BHASKARAN, K. AND M. PINEDO. 1992. Dispatching. In Handbook of Industrial Engineering. G. Salvendy (ed.), Wiley, New York.
3. BRAMEL, J. AND D. SIMCHI-LEVI. 1995. A Location Based Heuristic for General Routing Problems. Opns. Res. 43, 649-660.
4. BRAMEL, J. AND D. SIMCHI-LEVI. 1996. Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Opns. Res. 44, 501-509.
5. CHAN, L. M. A., A. MURIEL, AND D. SIMCHI-LEVI. 1996. Parallel Machine Scheduling, Linear Programming and Parameter List Scheduling Heuristics. Opns. Res.
6. COFFMAN, E. G., G. N. FREDERICKSON, AND G. S. LUEKER. 1982. Probabilistic Analysis of the LPT Processor Scheduling Heuristic. Deterministic and Stochastic Scheduling. M. A. H. Dempster et al. (eds.), D. Reidel Publishing Company. 319-331.
7. FRENK, J. B. G. AND A. H. G. RINNOOY KAN. 1987. The Asymptotic Optimality of the LPT rule. Math. O. R. 12, 241-254.
8. GAREY, M. R., D. S. JOHNSON, AND R. SETHI. 1976. The Complexity of Flowshop and Jobshop Scheduling. Math. O. R. 1, 117-129.
9. IGNALL, E. AND L. SCHRAGE. 1965. Application of the Branch and Bound Technique to some Flow-Shop Scheduling Problems. Opns. Res. 13, 400-412.
10. KAMINSKY, P. 1997. Doctoral Dissertation: Probabilistic Analysis and Practical Algorithms for Large Scale Scheduling Problems. Northwestern University.
11. KAMINSKY, P. AND D. SIMCHI-LEVI. 1998. Shop Scheduling at S&C Electric Co., Internal Report, Northwestern University.
12. KAMINSKY, P. AND D. SIMCHI-LEVI. 1997. The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem. Working Paper, Northwestern University.
13. KOHLER, W. AND K. STEIGLITZ. 1975. Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow Shop Problem n/2/F/F̄. J. Assoc. Comput. Machinery 22, 106-114.
14. KRONE, M. J. AND K. STEIGLITZ. 1974. Heuristic Programming Solutions of a Flowshop Scheduling Problem. Opns. Res. 22, 629-638.
15. LOULOU, R. 1984. Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling. Math. O. R. 9, 142-150.
16. MCCORMICK, S. T., M. L. PINEDO, S. SHENKER, AND B. WOLF. 1989. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Opns. Res. 37, 925-936.
17. MORTON, T. AND D. PENTICO. 1993. Heuristic Scheduling Systems. Wiley-Interscience, New York.
18. PINEDO, M. 1995. Scheduling: Theory, Algorithms and Systems. Prentice Hall, Inc., Englewood Cliffs, NJ.
19. RAMUDHIN, A, J. J. BARTHOLDI, J. CALVIN, J. H. VANDE VATE, AND G. WEISS. 1996. A Probabilistic Analysis of 2-Machine Flowshops. Opns. Res. 44, 899-908.
20. SPACCAMELA, A. M., W. S. RHEE, L. STOUGIE, AND S. VAN DE GEER. 1992. Probabilistic Analysis of the Minimum Weighted Flowtime Scheduling Problem. O. R. Lett. 11, 67-71.
21. SZWARC, W. 1983. The Flow-Shop Problem with Mean Completion Time Criterion. IIE Trans. 15, 172-176.
22. VAN DE VELDE, S. L. 1990. Minimizing the Sum of the Job Completion Times in the Two-Machine Flow Shop by Lagrangean Relaxation. Ann. Opns. Res. 26, 257-268.
23. WEBSTER, S. 1993. Bounds and Asymptotic Results for the Uniform Parallel Processor Weighted Flow Time Problem. O. R. Lett. 41, 186-193.