IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v174y2006i1p150-168.html
   My bibliography  Save this article

Modelling complex assemblies as a queueing network for lead time control

Author

Listed:
  • Azaron, Amir
  • Katagiri, Hideki
  • Kato, Kosuke
  • Sakawa, Masatoshi

Abstract

No abstract is available for this item.

Suggested Citation

  • Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    • Handle: RePEc:eee:ejores:v:174:y:2006:i:1:p:150-168
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00134-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    2. Elmaghraby, S. E. & Ferreira, A. A. & Tavares, L. V., 2000. "Optimal start times under stochastic activity durations," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 153-164, March.
    3. Kerbache, Laoucine & Smith, J. MacGregor, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 121(1), pages 105-123, February.
    4. Azaron, Amir & Fatemi Ghomi, S. M. T., 2003. "Optimal control of service rates and arrivals in Jackson networks," European Journal of Operational Research, Elsevier, vol. 147(1), pages 17-31, May.
    5. J. MacGregor Smith & Sophia Daskalaki, 1988. "Buffer Space Allocation in Automated Assembly Lines," Operations Research, INFORMS, vol. 36(2), pages 343-358, April.
    6. Kent H. Tseng & Man-Tung T. Hsiao, 1995. "Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline," Operations Research, INFORMS, vol. 43(1), pages 89-101, February.
    7. Song, D. P. & Hicks, C. & Earl, C. F., 2002. "Product due date assignment for complex assemblies," International Journal of Production Economics, Elsevier, vol. 76(3), pages 243-256, April.
    8. Haskose, A. & Kingsman, B. G. & Worthington, D., 2002. "Modelling flow and jobbing shops as a queueing network for workload control," International Journal of Production Economics, Elsevier, vol. 78(3), pages 271-285, August.
    9. V. G. Kulkarni & V. G. Adlakha, 1986. "Markov and Markov-Regenerative pert Networks," Operations Research, INFORMS, vol. 34(5), pages 769-781, October.
    10. J. J. Martin, 1965. "Distribution of the Time Through a Directed, Acyclic Network," Operations Research, INFORMS, vol. 13(1), pages 46-66, February.
    11. A. Charnes & W. W. Cooper & G. L. Thompson, 1964. "Critical Path Analyses Via Chance Constrained and Stochastic Programming," Operations Research, INFORMS, vol. 12(3), pages 460-470, June.
    12. Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
    13. Cheng, T. C. E. & Gupta, M. C., 1989. "Survey of scheduling research involving due date determination decisions," European Journal of Operational Research, Elsevier, vol. 38(2), pages 156-166, January.
    14. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    15. Austin J. Lemoine, 1979. "Note--On Total Sojourn Time in Networks of Queues," Management Science, INFORMS, vol. 25(10), pages 1034-1035, October.
    16. Abraham Seidmann & Milton L. Smith, 1981. "Due Date Assignment for Production Systems," Management Science, INFORMS, vol. 27(5), pages 571-581, May.
    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. Shabnam Rekabi & Ali Ghodratnama & Amir Azaron, 2022. "Designing pharmaceutical supply chain networks with perishable items considering congestion," Operational Research, Springer, vol. 22(4), pages 4159-4219, September.
    2. Shi, Chuan & Gershwin, Stanley B., 2016. "Part sojourn time distribution in a two-machine line," European Journal of Operational Research, Elsevier, vol. 248(1), pages 146-158.
    3. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    4. Azaron, A. & Brown, K.N. & Tarim, S.A. & Modarres, M., 2008. "A multi-objective stochastic programming approach for supply chain design considering risk," International Journal of Production Economics, Elsevier, vol. 116(1), pages 129-138, November.
    5. Saeed Yaghoubi, 2015. "Due-date assignment for multi-server multi-stage assembly systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(7), pages 1246-1256, May.

    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. Perkgoz, Cahit & Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2007. "A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 180(1), pages 292-308, July.
    2. Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Kato, Kosuke & Memariani, Azizollah, 2006. "A multi-objective resource allocation problem in PERT networks," European Journal of Operational Research, Elsevier, vol. 172(3), pages 838-854, August.
    3. Azaron, Amir & Fynes, Brian & Modarres, Mohammad, 2011. "Due date assignment in repetitive projects," International Journal of Production Economics, Elsevier, vol. 129(1), pages 79-85, January.
    4. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Longest path analysis in networks of queues: Dynamic scheduling problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 132-149, October.
    5. Song, D. P. & Hicks, C. & Earl, C. F., 2002. "Product due date assignment for complex assemblies," International Journal of Production Economics, Elsevier, vol. 76(3), pages 243-256, April.
    6. Saeed Yaghoubi, 2015. "Due-date assignment for multi-server multi-stage assembly systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(7), pages 1246-1256, May.
    7. Azaron, Amir & Fatemi Ghomi, S.M.T., 2008. "Lower bound for the mean project completion time in dynamic PERT networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 120-127, April.
    8. Hui-Yu Zhang & Qing-Xin Chen & James MacGregor Smith & Ning Mao & Ai-Lin Yu & Zhan-Tao Li, 2017. "Performance analysis of open general queuing networks with blocking and feedback," International Journal of Production Research, Taylor & Francis Journals, vol. 55(19), pages 5760-5781, October.
    9. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    10. Amir Azaron & Hideki Katagiri & Masatoshi Sakawa, 2007. "Time-cost trade-off via optimal control theory in Markov PERT networks," Annals of Operations Research, Springer, vol. 150(1), pages 47-64, March.
    11. Osorio, Carolina & Bierlaire, Michel, 2012. "A tractable analytical model for large-scale congested protein synthesis networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 588-597.
    12. Tancrez, Jean-Sbastien & Semal, Pierre & Chevalier, Philippe, 2009. "Histogram based bounds and approximations for production lines," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1133-1141, September.
    13. Davaadorjin Monhor, 2011. "A new probabilistic approach to the path criticality in stochastic PERT," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(4), pages 615-633, December.
    14. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    15. Chen, Shih-Pin, 2004. "Parametric nonlinear programming for analyzing fuzzy queues with finite capacity," European Journal of Operational Research, Elsevier, vol. 157(2), pages 429-438, September.
    16. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    17. Chen, Shih-Pin, 2007. "Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method," European Journal of Operational Research, Elsevier, vol. 177(1), pages 445-457, February.
    18. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    19. Pinar Keskinocak & R. Ravi & Sridhar Tayur, 2001. "Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues," Management Science, INFORMS, vol. 47(2), pages 264-279, February.
    20. Kerbache, Laoucine & MacGregor Smith, James, 2004. "Queueing networks and the topological design of supply chain systems," International Journal of Production Economics, Elsevier, vol. 91(3), pages 251-272, October.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:174:y:2006:i:1:p:150-168. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.