IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v45y1999i1p116-130.html
   My bibliography  Save this article

A Practical Scheduling Method for Multiclass Production Systems with Setups

Author

Listed:
  • Tava Lennon Olsen

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117)

Abstract

Consider a multiclass production system where many job classes share a single server and a setup time is incurred whenever the server changes class. This paper presents a simple method for scheduling these systems that performs well, not only with respect to mean waiting time, but also with respect to waiting-time variance and the outer percentiles of waiting time. The scheduling method is dynamic and uses the ages of items in each queue, as well as the queue statistics, to decide which queue to service next.

Suggested Citation

  • Tava Lennon Olsen, 1999. "A Practical Scheduling Method for Multiclass Production Systems with Setups," Management Science, INFORMS, vol. 45(1), pages 116-130, January.
    • Handle: RePEc:inm:ormnsc:v:45:y:1999:i:1:p:116-130
    DOI: 10.1287/mnsc.45.1.116
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.45.1.116
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.45.1.116?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Martin I. Reiman & Lawrence M. Wein, 1998. "Dynamic Scheduling of a Two-Class Queue with Setups," Operations Research, INFORMS, vol. 46(4), pages 532-547, August.
    2. Sunder Kekre & Kannan Srinivasan, 1990. "Broader Product Line: A Necessity to Achieve Success?," Management Science, INFORMS, vol. 36(10), pages 1216-1232, October.
    3. S. W. Fuhrmann & Robert B. Cooper, 1985. "Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations," Operations Research, INFORMS, vol. 33(5), pages 1117-1129, October.
    4. Izak Duenyas & Mark P. Van Oyen, 1996. "Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups," Management Science, INFORMS, vol. 42(6), pages 814-829, June.
    5. Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Grasman, Scott E. & Olsen, Tava Lennon & Birge, John R., 2005. "Finite buffer polling models with routing," European Journal of Operational Research, Elsevier, vol. 165(3), pages 794-809, September.
    2. Kyle Y. Lin & Moshe Kress & Roberto Szechtman, 2009. "Scheduling policies for an antiterrorist surveillance system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 113-126, March.
    3. Wei-Min Lan & Tava Lennon Olsen, 2006. "Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules," Operations Research, INFORMS, vol. 54(3), pages 505-522, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexey Matveev & Varvara Feoktistova & Ksenia Bolshakova, 2016. "On Global Near Optimality of Special Periodic Protocols for Fluid Polling Systems with Setups," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 1055-1070, December.
    2. Awi Federgruen & Ziv Katalan, 1998. "Determining Production Schedules Under Base-Stock Policies in Single Facility Multi-Item Production Systems," Operations Research, INFORMS, vol. 46(6), pages 883-898, December.
    3. Robert B. Cooper & Shun-Chen Niu & Mandyam M. Srinivasan, 1998. "When Does Forced Idle Time Improve Performance in Polling Models?," Management Science, INFORMS, vol. 44(8), pages 1079-1086, August.
    4. David M. Markowitz & Lawrence M. Wein, 2001. "Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem," Operations Research, INFORMS, vol. 49(2), pages 246-270, April.
    5. Wei-Min Lan & Tava Lennon Olsen, 2006. "Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules," Operations Research, INFORMS, vol. 54(3), pages 505-522, June.
    6. Claudio Giachetti & Giovanni Battista Dagnino, 2014. "Detecting the relationship between competitive intensity and firm product line length: Evidence from the worldwide mobile phone industry," Strategic Management Journal, Wiley Blackwell, vol. 35(9), pages 1398-1409, September.
    7. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Zheng-Guo Lv & Ji-Bo Wang, 2023. "Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation," Mathematics, MDPI, vol. 11(23), pages 1-14, November.
    8. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case," Economics Working Papers 314, Department of Economics and Business, Universitat Pompeu Fabra, revised Aug 1998.
    9. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2001. "Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems," Management Science, INFORMS, vol. 47(10), pages 1421-1439, October.
    10. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    11. Peter Cappelli, 1995. "Rethinking Employment," British Journal of Industrial Relations, London School of Economics, vol. 33(4), pages 563-602, December.
    12. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    13. Wallace J. Hopp & Xiaowei Xu, 2005. "Product Line Selection and Pricing with Modularity in Design," Manufacturing & Service Operations Management, INFORMS, vol. 7(3), pages 172-187, August.
    14. Cheng, T. C. Edwin & Janiak, Adam & Kovalyov, Mikhail Y., 2001. "Single machine batch scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 135(1), pages 177-183, November.
    15. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 306-330, May.
    16. Kyuwan Choi & Kyung Ho Kang & Seoki Lee & Kyuseok Lee, 2011. "Impact of Brand Diversification on Firm Performance: A Study of Restaurant Firms," Tourism Economics, , vol. 17(4), pages 885-903, August.
    17. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    18. Lee, Kyungyul & Kwon, Youngsun, 2018. "How does the competitive intensity affect the firm's product strategies?," 22nd ITS Biennial Conference, Seoul 2018. Beyond the boundaries: Challenges for business, policy and society 190406, International Telecommunications Society (ITS).
    19. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    20. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:1:p:116-130. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.