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

Flow-shops with a dominant machine

Author

Listed:
  • van den Nouweland, Anne
  • Krabbenborg, Marc
  • Potters, Jos

Abstract

No abstract is available for this item.

Suggested Citation

  • van den Nouweland, Anne & Krabbenborg, Marc & Potters, Jos, 1992. "Flow-shops with a dominant machine," European Journal of Operational Research, Elsevier, vol. 62(1), pages 38-46, October.
    • Handle: RePEc:eee:ejores:v:62:y:1992:i:1:p:38-46
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(92)90175-9
    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. Cheng, MingBao & Sun, ShiJie & He, LongMin, 2007. "Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines," European Journal of Operational Research, Elsevier, vol. 183(1), pages 115-124, November.
    2. Herbert Hamers & Flip Klijn & Bas Velzen, 2005. "On the Convexity of Precedence Sequencing Games," Annals of Operations Research, Springer, vol. 137(1), pages 161-175, July.
    3. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    4. Marco Slikker, 2005. "Balancedness of Sequencing Games with Multiple Parallel Machines," Annals of Operations Research, Springer, vol. 137(1), pages 177-189, July.
    5. van Velzen, S., 2003. "Sequencing Games with Controllable Processing Time," Other publications TiSEM 11af3da0-1a01-4be4-bed7-1, Tilburg University, School of Economics and Management.
    6. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Discussion Paper 2002-49, Tilburg University, Center for Economic Research.
    7. Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M. & Slikker, M., 2008. "Batch Sequencing and Cooperation," Discussion Paper 2008-100, Tilburg University, Center for Economic Research.
    8. Nekoiemehr, Nooshin & Selvarajah, Esaignani & Zhang, Guoqing, 2015. "Scheduling of jobs with cross families in two stage manufacturing systems," International Journal of Production Economics, Elsevier, vol. 167(C), pages 88-96.
    9. Atay, Ata & Calleja, Pedro & Soteras, Sergio, 2021. "Open shop scheduling games," European Journal of Operational Research, Elsevier, vol. 295(1), pages 12-21.
    10. Ciftci, B.B., 2009. "A cooperative approach to sequencing and connection problems," Other publications TiSEM b0f08a17-4734-4d57-ad66-f, Tilburg University, School of Economics and Management.
    11. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Other publications TiSEM 14e21ac6-26af-438e-943b-9, Tilburg University, School of Economics and Management.
    12. Mitra, Manipushpak, 2005. "Incomplete information and multiple machine queueing problems," European Journal of Operational Research, Elsevier, vol. 165(1), pages 251-266, August.
    13. van Velzen, S., 2003. "Sequencing Games with Controllable Processing Time," Discussion Paper 2003-105, Tilburg University, Center for Economic Research.
    14. van Velzen, Bas, 2006. "Sequencing games with controllable processing times," European Journal of Operational Research, Elsevier, vol. 172(1), pages 64-85, July.
    15. J-B Wang & Z-Q Xia, 2006. "Flow shop scheduling problems with deteriorating jobs under dominating machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 220-226, February.
    16. Pedro Calleja & Peter Borm & Herbert Hamers & Flip Klijn & Marco Slikker, 2002. "On a New Class of Parallel Sequencing Situations and Related Games," Annals of Operations Research, Springer, vol. 109(1), pages 265-277, January.
    17. Sun, Lin-Hui & Sun, Lin-Yan & Wang, Ming-Zheng & Wang, Ji-Bo, 2012. "Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines," International Journal of Production Economics, Elsevier, vol. 138(1), pages 195-200.
    18. Cepek, Ondrej & Okada, Masanori & Vlach, Milan, 2002. "Nonpreemptive flowshop scheduling with machine dominance," European Journal of Operational Research, Elsevier, vol. 139(2), pages 245-261, June.
    19. Wang, Ji-Bo & Xia, Zun-Quan, 2006. "Flow shop scheduling with deteriorating jobs under dominating machines," Omega, Elsevier, vol. 34(4), pages 327-336, August.
    20. J-B Wang & Z-Q Xia, 2005. "Flow-shop scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(11), pages 1325-1330, November.
    21. Herbert Hamers & Flip Klijn & Marco Slikker, 2013. "Price of Anarchy in Sequencing Situations and the Impossibility to Coordinate," Working Papers 709, Barcelona School of Economics.
    22. Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December.

    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:62:y:1992:i:1:p:38-46. 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.