IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v55y1998i1p53-56.html
   My bibliography  Save this article

An exact algorithm for batching and scheduling two part types in a mixed shop: A technical note

Author

Listed:
  • Edwin Cheng, T. C.
  • Kovalyov, Mikhail Y.

Abstract

No abstract is available for this item.

Suggested Citation

  • Edwin Cheng, T. C. & Kovalyov, Mikhail Y., 1998. "An exact algorithm for batching and scheduling two part types in a mixed shop: A technical note," International Journal of Production Economics, Elsevier, vol. 55(1), pages 53-56, June.
  • Handle: RePEc:eee:proeco:v:55:y:1998:i:1:p:53-56
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(98)00039-5
    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. Peter Brucker & Mikhail Kovalyov & Yakov Shafransky & Frank Werner, 1998. "Batch scheduling with deadlines on parallel machines," Annals of Operations Research, Springer, vol. 83(0), pages 23-40, October.
    2. Ching, Chung Yaw & Liao, Ching-Jong & Wu, Chutao John, 1997. "Batching to minimize total production time for two part types," International Journal of Production Economics, Elsevier, vol. 48(1), pages 63-72, January.
    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. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.

    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. Cheng, T.C.E. & Shafransky, Y. & Ng, C.T., 2016. "An alternative approach for proving the NP-hardness of optimization problems," European Journal of Operational Research, Elsevier, vol. 248(1), pages 52-58.
    2. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    3. Alexandre Dolgui & Mikhail Y. Kovalyov & Alain Quilliot, 2018. "Simple paths with exact and forbidden lengths," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 78-85, February.

    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:proeco:v:55:y:1998:i:1:p:53-56. 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/ijpe .

    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.