IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v4y2003p7.html
   My bibliography  Save this article

On the unknown contribution of Stefan Chanas to the stochastic flow shop analysis

Author

Listed:
  • Jerzy Kamburowski

Abstract

The paper deals with the problem of minimizing the makespan in flow shops with random job processing times. We present recent advances in stochastic flow shop analysis in which the so-called reversibility property plays a crucial role. The paper is written in memory of Stefan Chanas, who observed first that this property must be utilized in order to tackle the complexity of stochastic flow shops.

Suggested Citation

  • Jerzy Kamburowski, 2003. "On the unknown contribution of Stefan Chanas to the stochastic flow shop analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 13(4), pages 75-83.
    • Handle: RePEc:wut:journl:v:4:y:2003:p:7
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/200348%20-%20published.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kamburowski, Jerzy, 1999. "Stochastically minimizing the makespan in two-machine flow shops without blocking," European Journal of Operational Research, Elsevier, vol. 112(2), pages 304-309, January.
    2. Andrew A. Cunningham & Sujit K. Dutta, 1973. "Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 20(1), pages 69-81, March.
    3. Wlodzimierz Szwarc, 1977. "Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem," Operations Research, INFORMS, vol. 25(1), pages 70-77, February.
    4. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    5. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    6. Kamburowski, Jerzy, 2000. "On three-machine flow shops with random job processing times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 440-448, September.
    Full references (including those not matched with items on IDEAS)

    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. P J Kalczynski & J Kamburowski, 2004. "Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1358-1362, December.
    2. J Jackman & Z Guerra de Castillo & S Olafsson, 2011. "Stochastic flow shop scheduling model for the Panama Canal," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 69-80, January.
    3. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    4. Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
    5. Zongxu Mu & Minming Li, 2015. "DVS scheduling in a line or a star network of processors," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 16-35, January.
    6. Jan Gmys, 2022. "Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2502-2522, September.
    7. A.A. Gladky & Y.M. Shafransky & V.A. Strusevich, 2004. "Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 13-28, March.
    8. Yong Chen & Yinhui Cai & Longcheng Liu & Guangting Chen & Randy Goebel & Guohui Lin & Bing Su & An Zhang, 2022. "Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 571-588, April.
    9. Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2005. "Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity," European Journal of Operational Research, Elsevier, vol. 161(1), pages 126-147, February.
    10. Shabtay, Dvir & Gerstl, Enrique, 2024. "Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 887-898.
    11. Rossit, Daniel A. & Vásquez, Óscar C. & Tohmé, Fernando & Frutos, Mariano & Safe, Martín D., 2021. "A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 289(3), pages 841-854.
    12. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    13. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2021. "Minimizing total completion time in the two-machine no-idle no-wait flow shop problem," Journal of Heuristics, Springer, vol. 27(1), pages 159-173, April.
    14. Jianming Dong & Yong Chen & An Zhang & Qifan Yang, 2013. "A new three-machine shop scheduling: complexity and approximation algorithm," Journal of Combinatorial Optimization, Springer, vol. 26(4), pages 799-810, November.
    15. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    16. Rhonda Righter, 1997. "A generalized Johnson's rule for stochastic assembly systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(2), pages 211-220, March.
    17. Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2003. "A contribution to the stochastic flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 415-433, December.
    18. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    19. Thierry Garaix & Salim Rostami & Xiaolan Xie, 2020. "Daily outpatient chemotherapy appointment scheduling with random deferrals," Flexible Services and Manufacturing Journal, Springer, vol. 32(1), pages 129-153, March.
    20. Li, Wei & Nault, Barrie R. & Ye, Honghan, 2019. "Trade-off balancing in scheduling for flow shop production and perioperative processes," European Journal of Operational Research, Elsevier, vol. 273(3), pages 817-830.

    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:wut:journl:v:4:y:2003:p:7. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.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.