IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v67y2016i8d10.1057_jors.2015.108.html
   My bibliography  Save this article

Scheduling products with subassemblies and changeover time

Author

Listed:
  • Xinxin Hu

    (University of Houston Downtown)

  • James D Blocher

    (Indiana University)

  • Hans Sebastian Heese

    () (EBS University)

  • Feng Zhou

    (California State University Stanislaus)

Abstract

Abstract We revisit the problem, previously studied by Coffman et al, of scheduling products with two subassemblies on a common resource, where changeovers consume time, under the objective of flow-time minimization. We derive some previously unidentified structural properties that could be important to researchers working on similar batch scheduling problems. We show that there exists a series of base schedules from which optimal schedules can be easily derived. As these base schedules build on each other, they are easy to construct as well. We also show that the structure of these base schedules is such that batch sizes decrease over time in a well-defined manner. These insights about the general form of the schedules might also be important to practitioners wanting some intuition about the schedule structure that they are implementing.

Suggested Citation

  • Xinxin Hu & James D Blocher & Hans Sebastian Heese & Feng Zhou, 2016. "Scheduling products with subassemblies and changeover time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(8), pages 1025-1033, August.
  • Handle: RePEc:pal:jorsoc:v:67:y:2016:i:8:d:10.1057_jors.2015.108
    DOI: 10.1057/jors.2015.108
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2015.108
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    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. Mosheiov, Gur & Oron, Daniel, 2008. "Open-shop batch scheduling with identical jobs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1282-1292, June.
    2. Gregory Dobson & Uday S. Karmarkar & Jeffrey L. Rummel, 1987. "Batching to Minimize Flow Times on One Machine," Management Science, INFORMS, vol. 33(6), pages 784-799, June.
    3. Cheng, T.C.E. & Ng, C.T. & Yuan, J.J., 2008. "Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time," European Journal of Operational Research, Elsevier, vol. 191(2), pages 320-331, December.
    4. 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.
    5. Gerodimos, Alex E. & Glass, Celia A. & Potts, Chris N., 2000. "Scheduling the production of two-component jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 120(2), pages 250-259, January.
    6. Bongjin Gim & Min-Hong Han, 1997. "Economic scheduling of products with N components on a single machine," European Journal of Operational Research, Elsevier, vol. 96(3), pages 570-577, February.
    7. B. Lin & T. Cheng, 2005. "Two-Machine Flowshop Batching and Scheduling," Annals of Operations Research, Springer, vol. 133(1), pages 149-161, January.
    8. 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.
    Full references (including those not matched with items on IDEAS)

    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:pal:jorsoc:v:67:y:2016:i:8:d:10.1057_jors.2015.108. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.palgrave-journals.com/ .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.