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

Stochastically minimizing total flowtime in flowshops with no waiting space

Author

Listed:
  • Allahverdi, Ali

Abstract

No abstract is available for this item.

Suggested Citation

  • Allahverdi, Ali, 1999. "Stochastically minimizing total flowtime in flowshops with no waiting space," European Journal of Operational Research, Elsevier, vol. 113(1), pages 101-112, February.
    • Handle: RePEc:eee:ejores:v:113:y:1999:i:1:p:101-112
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00438-4
    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. Allahverdi, Ali & Mittenthal, John, 1995. "Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function," European Journal of Operational Research, Elsevier, vol. 81(2), pages 376-387, March.
    2. John Mittenthal & M. Raghavachari, 1993. "Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties," Operations Research, INFORMS, vol. 41(4), pages 786-796, August.
    3. Nicholas G. Hall & Chelliah Sriskandarajah, 1996. "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process," Operations Research, INFORMS, vol. 44(3), pages 510-525, June.
    4. Ali Allahverdi & John Mittenthal, 1994. "Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(5), pages 677-682, August.
    5. Chandrasekharan Rajendran & Dipak Chaudhuri, 1990. "Heuristic algorithms for continuous flow‐shop problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 695-705, October.
    6. Charles Du & Michael Pinedo, 1995. "A note on minimizing the expected makespan in flowshops subject to breakdowns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1251-1262, December.
    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. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    2. Y N Sotskov & A Allahverdi & T-C Lai, 2004. "Flowshop scheduling problem to minimize total completion time with random and bounded processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 277-286, March.

    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. Jian Yang & Gang Yu, 2002. "On the Robust Single Machine Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 17-33, March.
    2. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    3. Vacharapoom Benjaoran & Nashwan Dawood & Brian Hobbs, 2005. "Flowshop scheduling model for bespoke precast concrete production planning," Construction Management and Economics, Taylor & Francis Journals, vol. 23(1), pages 93-105.
    4. Rubén Ruiz & Ali Allahverdi, 2007. "Some effective heuristics for no-wait flowshops with setup times to minimize total completion time," Annals of Operations Research, Springer, vol. 156(1), pages 143-171, December.
    5. Faicel Hnaien & Taha Arbaoui, 2023. "Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown," Annals of Operations Research, Springer, vol. 328(2), pages 1437-1460, September.
    6. Yuan, Jinjiang & Soukhal, Ameur & Chen, Youjun & Lu, Lingfa, 2007. "A note on the complexity of flow shop scheduling with transportation constraints," European Journal of Operational Research, Elsevier, vol. 178(3), pages 918-925, May.
    7. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.
    8. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    9. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    10. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    11. Zhenpeng Li & Congdian Cheng, 2023. "The Expected Competitive Ratio on a Kind of Stochastic-Online Flowtime Scheduling with Machine Subject to an Uncertain Breakdown," Mathematics, MDPI, vol. 11(11), pages 1-12, May.
    12. Li, Wei & Glazebrook, Kevin D., 1998. "On stochastic machine scheduling with general distributional assumptions," European Journal of Operational Research, Elsevier, vol. 105(3), pages 525-536, March.
    13. Joaquín Bautista-Valhondo & Rocío Alfaro-Pozo, 2020. "Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types," 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. 28(1), pages 5-23, March.
    14. Matthias Bultmann & Sigrid Knust & Stefan Waldherr, 2018. "Flow shop scheduling with flexible processing times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 809-829, July.
    15. Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
    16. Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
    17. Alvarez-Valdes, R. & Fuertes, A. & Tamarit, J. M. & Gimenez, G. & Ramos, R., 2005. "A heuristic to schedule flexible job-shop in a glass factory," European Journal of Operational Research, Elsevier, vol. 165(2), pages 525-534, September.
    18. Soukhal, A. & Martineau, P., 2005. "Resolution of a scheduling problem in a flowshop robotic cell," European Journal of Operational Research, Elsevier, vol. 161(1), pages 62-72, February.
    19. Kravchenko, Svetlana A., 1998. "A polynomial algorithm for a two-machine no-wait job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 106(1), pages 101-107, April.
    20. Sawik, Tadeusz, 2004. "Loading and scheduling of a flexible assembly system by mixed integer programming," European Journal of Operational Research, Elsevier, vol. 154(1), pages 1-19, April.

    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:113:y:1999:i:1:p:101-112. 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.