IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v42y2010i3p221-231.html
   My bibliography  Save this article

Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times

Author

Listed:
  • Yaron Leyvand
  • Dvir Shabtay
  • George Steiner

Abstract

Scheduling problems with due date assignment and controllable processing times are studied in this paper. It is assumed that the job processing time is a linear function of the amount of resource allocated to the job, and all jobs share the same due date, which is a decision variable. The problems have many applications, e.g., in optimal delivery time quotation and order sequencing when outsourcing is an option. The quality of a schedule is measured by two different criteria. The first is the total weighted number of tardy jobs plus due date assignment cost, and the second one is the total weighted resource consumption. Four different problems for treating the two criteria are considered. It is shown that three of these problems are NP-hard in the ordinary sense, although the problem of minimizing an integrated objective function can be solved in polynomial time. A pseudo-polynomial time optimization algorithm is provided for the three NP-hard versions of the problem. A fully polynomial time algorithm for approximating a Pareto-optimal solution is also presented. Finally, important polynomially solvable special cases are highlighted.

Suggested Citation

  • Yaron Leyvand & Dvir Shabtay & George Steiner, 2010. "Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times," IISE Transactions, Taylor & Francis Journals, vol. 42(3), pages 221-231.
    • Handle: RePEc:taf:uiiexx:v:42:y:2010:i:3:p:221-231
    DOI: 10.1080/07408170903394322
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/07408170903394322
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/07408170903394322?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. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    2. George Steiner & Rui Zhang, 2011. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries," Annals of Operations Research, Springer, vol. 191(1), pages 171-181, November.
    3. Dujuan Wang & Yugang Yu & Huaxin Qiu & Yunqiang Yin & T. C. E. Cheng, 2020. "Two‐agent scheduling with linear resource‐dependent processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 573-591, October.
    4. Dujuan Wang & Yunqiang Yin & T.C.E. Cheng, 2017. "A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 41-63, February.
    5. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.

    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:taf:uiiexx:v:42:y:2010:i:3:p:221-231. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.