Multiproduct systems with both setup times and costs: Fluid bounds and schedules

Operations Research

Volumn 54, Issue 3, 2006, Pages 505-522

  Lan, Wei Min ^a   Olsen, Tava Lennon ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Production scheduling: stochastic sequencing; Queues: limit theorems

Indexed keywords

FLUID MODEL; PRODUCTION SYSTEM; PRODUCTION/SCHEDULING: STOCHASTIC SEQUENCING; QUEUES: LIMIT THEOREMS; SYSTEM PERFORMANCE;

APPROXIMATION THEORY; COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; RANDOM PROCESSES; SCHEDULING;

SYSTEMS ANALYSIS;

EID: 33744797704     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1060.0298     Document Type: Article

References (46)

1. Bazaraa, M. S., H. D. Sherali, C. M. Shetty. 1993. Nonlinear Programming Theory and Algorithms. John Wiley and Sons, New York.
2. Bertsimas, D., G. Mourtzinou. 1999. Decomposition results for general polling systems and their applications. Queueing Systems 31(3-4) 295-316.
3. Bertsimas, D., J. Niño-Mora. 1999a. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part 1, The single-station case. Math. Oper. Res. 24(2) 306-330.
4. Bertsimas, D., J. Niño-Mora. 1999b. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, The multi-station case. Math. Oper. Res. 24(2) 331-361.
5. Bertsimas, D., H. Xu. 1993. Optimization of polling systems and dynamic vehicle routing problems on networks. Working paper, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
6. Bertsimas, D., D. Gamarnik, J. Sethuraman. 2003. From fluid relaxations to practical algorithms for job shop scheduling: The holding cost objective. Oper. Res. 51(5) 798-813.
7. Boxma, O. J., D. G. Down. 1997. Dynamic server assignment in a two-queue model. Eur. J. Oper. Res. 103(3) 595-609.
8. Boxma, O. J., H. Levy, J. A. Westrate. 1991. Efficient visit frequencies for polling tables: Minimization of waiting cost. Queueing Systems Theory Appl. 9(1-2) 133-162.
9. Boxma, O. J., H. Levy, J. A. Westrate. 1993. Efficient visit orders for polling systems. Performance Evaluation 18(2) 103-123.
10. Browne, S., U. Yechiali. 1989. Dynamic priority rules for cyclic type queues. Adv. Appl. Probab. 21 432-450.
11. Chase, C., P. J. Ramadge. 1992. On real-time scheduling policies for flexible manufacturing systems. IEEE Trans. Automatic Control 37(4) 491-496.
12. Dai, J. G. 1995. On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5 49-77.
13. Dai, J. G., O. B. Jennings. 2004. Stabilizing queueing networks with setups. Math. Oper. Res. 29(4) 891-922.
14. Dai, J. G., G. Weiss. 2002. A fluid heuristic for minimizing makespan in job shops. Oper. Res. 50(4) 692-707.
15. Duenyas, I., M. P. Van Oyen. 1995. Stochastic scheduling of parallel queues with setup costs. Queueing Systems 19 421-444.
16. Duenyas, I., M. P. Van Oyen. 1996. Heuristic scheduling of parallel heterogeneous queues with setups. Management Sci. 42 814-829.
17. Elmaghraby, S. E. 1978. The economic lot scheduling problem (ELSP): Review and extensions. Management Sci. 24(6) 587-598.
18. Federgruen, A., Z. Katalan. 1998. Determining production schedules under base-stock policies in single facility multi-item production systems. Oper. Res. 46(6) 883-898.
19. Federgruen, A., G. Guillermo, Z. Katalan. 1999. The effect of product variety on manufacturing performance. Working paper, Columbia University, New York.
20. Fuhrmann, S. W., R. B. Cooper. 1985. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. 33(5) 1117-1129.
21. Hasenbein, J. 2002. Scheduling multiclass queueing networks via fluid models. Tutorial given at INFORMS Conf., San Jose, CA. http://www.me.utexas. edurhas/Tutorial.html.
22. Hofri, M., K. W. Ross. 1987. On the optimal control of two queues with server set-up times and its analysis. SIAM J. Comput. 16 399-420.
23. Jennings, O. B. 2000. Positive Harris recurrence of multiclass queueing networks with setups. Working paper, Fuqua School of Business, Duke University, Durham, NC.
24. Kim, E., M. P. Van Oyen, M. Rieders. 1998. General dynamic programming algorithms applied to polling systems. Comm. Statist.: Stochastic Models 14(5) 1197-1221.
25. Lan, W.-M. 2000. Dynamic scheduling of multi-product systems: Bounds and heuristics. Ph.D. dissertation, University of Michigan, Ann Arbor, MI.
26. Levy, H., M. Sidi. 1990. Polling systems: Applications, modeling, and optimization. IEEE Trans. Comm. 38(10) 1750-1760.
27. Liu, Z., P. Nain, D. Towsley. 1992. On optimal polling policies. Queueing Systems Theory Appl. 11 59-84.
28. Maglaras, C. 2000. Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10(3) 897-929.
29. Markowitz, D. M., L. M. Wein. 2001. Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem. Oper. Res. 49(2) 246-270.
30. Markowitz, D. M., M. I. Reiman, L. M. Wein. 2000. The stochastic economic lot scheduling problem: Heavy traffic analysis of dynamic cyclic policies. Oper. Res. 48(1) 136-154.
31. Meyn, S. P. 2001. Sequencing and routing in multiclass queueing networks. Part I: Feedback regulation. SIAM J. Control Optim. 40(3) 741-776.
32. Meyn, S. P. 2003. Sequencing and routing in multiclass queueing networks. Part II: Workload relaxations. SIAM J. Control Optim. 42(1) 178-217.
33. Nahmias, S. 1993. Production and Operations Analysis, 2nd ed. Irwin, Homewood, IL.
34. Nobel, R. D., R. Bekker. 2001. Optimal control for two queues with one switching server. R. Nadarajan, P. R. Kandasamy, eds. Mathematical and Computational Models. Allied Publishers Limited, New Delhi, India, 21-35.
35. Olsen, T. L. 1999. A practical scheduling method for multiclass production systems with setups. Management Sci. 45(1) 116-130.
36. Olsen, T. L. 2001. Limit theorems for polling models with increasing setups. Probab. Engrg. Inform. Sci. 15 35-55.
37. Olsen, T. L., R. D. van der Mei. 2005. Polling systems with periodic server routing in heavy-traffic: Renewal arrivals. OR Lett. 33(1) 17-25.
38. Perkins, J. R., P. R. Kumar. 1989. Stable, distributed, real-time scheduling of flexible manufacturing/assembly/disassembly systems. IEEE Trans. Automatic Control 34(2) 139-148.
39. Rybko, A. N., A. L. Stolyar. 1992. Ergodicity of stochastic processes describing the operation of open queueing networks. Problems Inform. Transmission 28 199-220.
40. Sox, C. R., P. L. Jackson, A. Bowman, J. A. Muckstadt. 1999. A review of the stochastic lot scheduling problem. Internat. J. Production Econom. 62(3) 181-200.
41. Takagi, H. 1986. Analysis of Polling Systems. MIT Press, Cambridge, MA.
42. Takagi, H. 1990. Queueing analysis of polling models: An update. H. Takagi, ed. Stochastic Analysis of Computer and Communication Systems, Chapter 1. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, The Netherlands, 267-318.
43. Takagi, H. 1997. Queueing analysis of polling models: Progress in 1990-1994. J. H. Dshalalow, ed. Frontiers in Queueing: Models and Applications in Science, and Engineering, Chapter 5. CRC Press, New York, 119-146.
44. van der Mei, R. D. 1999. Delay in polling systems with large switch-over times. J. Appl. Probab. 36 232-243.
45. van der Mei, R. D., H. Levy. 1997. Polling systems in heavy traffic: Exhaustiveness of service policies. Queueing Systems Theory Appl. 27 227-250.
46. Wolff, R. W. 1989. Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.