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

Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method

Author

Listed:
  • Chen, Shih-Pin

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:177:y:2007:i:1:p:445-457
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00913-6
    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. 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.
    2. Arnott, Richard & de Palma, Andre & Lindsey, Robin, 1999. "Information and time-of-usage decisions in the bottleneck model with stochastic capacity and demand," European Economic Review, Elsevier, vol. 43(3), pages 525-548, March.
    3. Sigrún Andradöttir, 1996. "A Scaled Stochastic Approximation Algorithm," Management Science, INFORMS, vol. 42(4), pages 475-498, April.
    4. Papadopoulos, H. T., 1996. "A field service support system using a queueing network model and the priority MVA algorithm," Omega, Elsevier, vol. 24(2), pages 195-203, April.
    5. Johansen, Soren Glud & Larsen, Christian, 2001. "Computation of a near-optimal service policy for a single-server queue with homogeneous jobs," European Journal of Operational Research, Elsevier, vol. 134(3), pages 648-663, November.
    6. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    7. Sigrún Andradóttir, 1995. "A Stochastic Approximation Algorithm with Varying Bounds," Operations Research, INFORMS, vol. 43(6), pages 1037-1048, December.
    8. Kuik, Roelof & Tielemans, Peter F. J., 2004. "Expected time in system analysis of a single-machine multi-item processing center," European Journal of Operational Research, Elsevier, vol. 156(2), pages 287-304, July.
    9. Pierre L'Ecuyer & Nataly Giroux & Peter W. Glynn, 1994. "Stochastic Optimization by Simulation: Numerical Experiments with the M/M/1 Queue in Steady-State," Management Science, INFORMS, vol. 40(10), pages 1245-1261, October.
    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. Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
    2. Chen, Shih-Pin, 2016. "Time value of delays in unreliable production systems with mixed uncertainties of fuzziness and randomness," European Journal of Operational Research, Elsevier, vol. 255(3), pages 834-844.
    3. Palanivel Kaliyaperumal & Amrit Das, 2022. "A Mathematical Model for Nonlinear Optimization Which Attempts Membership Functions to Address the Uncertainties," Mathematics, MDPI, vol. 10(10), pages 1-20, 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. Kao, Chiang & Chen, Shih-Pin, 2006. "A stochastic quasi-Newton method for simulation response optimization," European Journal of Operational Research, Elsevier, vol. 173(1), pages 30-46, August.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    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. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
    11. Stepanov, Alexander & Smith, James MacGregor, 2009. "Multi-objective evacuation routing in transportation networks," European Journal of Operational Research, Elsevier, vol. 198(2), pages 435-446, October.
    12. 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.
    13. Pourvaziri, Hani & Pierreval, Henri, 2017. "Dynamic facility layout problem based on open queuing network theory," European Journal of Operational Research, Elsevier, vol. 259(2), pages 538-553.
    14. Geng, Sunyue & Liu, Sifeng & Fang, Zhigeng, 2022. "An agent-based algorithm for dynamic routing in service networks," European Journal of Operational Research, Elsevier, vol. 303(2), pages 719-734.
    15. Cruz, F.R.B. & van Woensel, T. & MacGregor Smith, J. & Lieckens, K., 2010. "On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks," European Journal of Operational Research, Elsevier, vol. 201(1), pages 183-193, February.
    16. 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.
    17. 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.
    18. Yunyue He & Zhong Liu & Jianmai Shi & Yishan Wang & Jiaming Zhang & Jinyuan Liu, 2015. "K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    19. Osorio, Carolina & Flötteröd, Gunnar & Bierlaire, Michel, 2011. "Dynamic network loading: A stochastic differentiable model that derives link state distributions," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1410-1423.
    20. Tsai, Eline R. & Demirtas, Derya & Tintu, Andrei N. & de Jonge, Robert & de Rijke, Yolanda B. & Boucherie, Richard J., 2023. "Design of fork-join networks of First-In-First-Out and infinite-server queues applied to clinical chemistry laboratories," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1101-1117.

    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:177:y:2007:i:1:p:445-457. 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.