IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i6d10.1057_palgrave.jors.2601359.html
   My bibliography  Save this article

Scheduling start time dependent jobs to minimize the total weighted completion time

Author

Listed:
  • A Bachman

    (Wroclaw University of Technology)

  • T C E Cheng

    (The Hong Kong Polytechnic University)

  • A Janiak

    (Wroclaw University of Technology)

  • C T Ng

    (The Hong Kong Polytechnic University)

Abstract

This paper deals with a single machine scheduling problem with start time dependent job processing times. The job processing times are characterized by decreasing linear functions dependent on their start times. The problem is to find a schedule for which the total weighted completion time is minimized. It is proved that the problem is NP-hard. Some properties of special cases of the general problem are also given. Based on these results, two heuristic algorithms are constructed and their performance is compared.

Suggested Citation

  • A Bachman & T C E Cheng & A Janiak & C T Ng, 2002. "Scheduling start time dependent jobs to minimize the total weighted completion time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(6), pages 688-693, June.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave.jors.2601359
    DOI: 10.1057/palgrave.jors.2601359
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601359
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601359?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Xingong Zhang & Guangle Yan & Wanzhen Huang & Guochun Tang, 2011. "Single-machine scheduling problems with time and position dependent processing times," Annals of Operations Research, Springer, vol. 186(1), pages 345-356, June.
    2. Rachaniotis, Nikolaos P. & Dasaklis, Tom K. & Pappis, Costas P., 2012. "A deterministic resource scheduling model in epidemic control: A case study," European Journal of Operational Research, Elsevier, vol. 216(1), pages 225-231.
    3. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    4. Cheng, T. C. E. & Ding, Q. & Lin, B. M. T., 2004. "A concise survey of scheduling with time-dependent processing times," European Journal of Operational Research, Elsevier, vol. 152(1), pages 1-13, January.
    5. Sawik, Tadeusz, 2010. "An integer programming approach to scheduling in a contaminated area," Omega, Elsevier, vol. 38(3-4), pages 179-191, June.
    6. Jin, Xianfei & Li, Kunpeng & Sivakumar, Appa Iyer, 2013. "Scheduling and optimal delivery time quotation for customers with time sensitive demand," International Journal of Production Economics, Elsevier, vol. 145(1), pages 349-358.
    7. Gonzalo Mejía & Carlos Montoya, 2010. "Applications of resource assignment and scheduling with Petri Nets and heuristic search," Annals of Operations Research, Springer, vol. 181(1), pages 795-812, December.
    8. Lee, Wen-Chiung & Shiau, Yau-Ren & Chen, Shiuan-Kang & Wu, Chin-Chia, 2010. "A two-machine flowshop scheduling problem with deteriorating jobs and blocking," International Journal of Production Economics, Elsevier, vol. 124(1), pages 188-197, March.

    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:53:y:2002:i:6:d:10.1057_palgrave.jors.2601359. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.