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

Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop

Author

Listed:
  • Ahmadi, Reza H.
  • Bagchi, Uttarayan

Abstract

No abstract is available for this item.

Suggested Citation

  • Ahmadi, Reza H. & Bagchi, Uttarayan, 1990. "Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop," European Journal of Operational Research, Elsevier, vol. 44(3), pages 331-336, February.
    • Handle: RePEc:eee:ejores:v:44:y:1990:i:3:p:331-336
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(90)90244-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.

    Citations

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


    Cited by:

    1. Chung, Chia-Shin & Flynn, James & Kirca, Omer, 2002. "A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems," International Journal of Production Economics, Elsevier, vol. 79(3), pages 185-196, October.
    2. Tirupati Devanath & Peeyush Mehta & Chandra, Pankaj, 2004. "Permutation Flowshop Scheduling with Earliness and Tardiness Penalties," IIMA Working Papers WP2004-07-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Detienne, Boris & Sadykov, Ruslan & Tanaka, Shunji, 2016. "The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation," European Journal of Operational Research, Elsevier, vol. 252(3), pages 750-760.
    4. Azizoglu, Meral & Cakmak, Ergin & Kondakci, Suna, 2001. "A flexible flowshop problem with total flow time minimization," European Journal of Operational Research, Elsevier, vol. 132(3), pages 528-538, August.
    5. Gharbi, Anis & Ladhari, Talel & Msakni, Mohamed Kais & Serairi, Mehdi, 2013. "The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies," European Journal of Operational Research, Elsevier, vol. 231(1), pages 69-78.
    6. Chengen Wang & Chengbin Chu & Proth, Jean-Marie, 1997. "Heuristic approaches for n/m/F/ [summation operator]Ci scheduling problems," European Journal of Operational Research, Elsevier, vol. 96(3), pages 636-644, February.
    7. Allahverdi, Ali & Al-Anzi, Fawaz S., 2006. "A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times," European Journal of Operational Research, Elsevier, vol. 169(3), pages 767-780, March.
    8. M S Nagano & J V Moccellin, 2008. "Reducing mean flow time in permutation flow shop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 939-945, July.
    9. Selcuk Karabati & Panagiotis Kouvelis, 1993. "The permutation flow shop problem with sum‐of‐completion times performance criterion," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(6), pages 843-862, October.
    10. Allahverdi, Ali & Aldowaisan, Tariq, 2002. "New heuristics to minimize total completion time in m-machine flowshops," International Journal of Production Economics, Elsevier, vol. 77(1), pages 71-83, May.
    11. Lin, Bertrand M.T. & Lin, Y.-Y. & Fang, K.-T., 2013. "Two-machine flow shop scheduling of polyurethane foam production," International Journal of Production Economics, Elsevier, vol. 141(1), pages 286-294.
    12. J. A. Hoogeveen & T. Kawaguchi, 1999. "Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases," Mathematics of Operations Research, INFORMS, vol. 24(4), pages 887-910, November.
    13. Framinan, J. M. & Leisten, R., 2003. "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," Omega, Elsevier, vol. 31(4), pages 311-317, August.
    14. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    15. Della Croce, F. & Narayan, V. & Tadei, R., 1996. "The two-machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 227-237, 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:44:y:1990:i:3:p:331-336. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.