IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v40y1993i1p85-101.html
   My bibliography  Save this article

Single‐machine scheduling with early and tardy completion costs

Author

Listed:
  • J. Steve Davis
  • John J. Kanet

Abstract

We address a single‐machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early completion penalties. Tardiness penalties arise from a variety of sources, such as loss of customer goodwill, opportunity costs of lost sales, and direct cash penalties. Accounting for earliness cost makes the performance measure nonregular, and this nonregularity has apparently discouraged researchers from seeking solutions to this problem. We found that it is not much more difficult to design an enumerative search for this problem than it would be if the performance measure were regular. We present and demonstrate an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations.© 1993 John Wiley & Sons, Inc.

Suggested Citation

  • J. Steve Davis & John J. Kanet, 1993. "Single‐machine scheduling with early and tardy completion costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 85-101, February.
    • Handle: RePEc:wly:navres:v:40:y:1993:i:1:p:85-101
    DOI: 10.1002/1520-6750(199302)40:13.0.CO;2-C
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199302)40:13.0.CO;2-C
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199302)40:13.0.CO;2-C?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
    ---><---

    References listed on IDEAS

    as
    1. Alan G. Merten & Mervin E. Muller, 1972. "Variance Minimization in Single Machine Sequencing Problems," Management Science, INFORMS, vol. 18(9), pages 518-528, May.
    2. Jeffrey B. Sidney, 1977. "Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties," Operations Research, INFORMS, vol. 25(1), pages 62-69, February.
    3. P. S. Sundararaghavan & Mesbah U. Ahmed, 1984. "Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 31(2), pages 325-333, June.
    4. Vina Vani & M. Raghavachari, 1987. "Deterministic and Random Single Machine Sequencing with Variance Minimization," Operations Research, INFORMS, vol. 35(1), pages 111-120, February.
    5. Kenneth R. Baker & James B. Martin, 1974. "An experimental comparison of solution algorithms for the single‐machine tardiness problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(1), pages 187-199, March.
    6. Samuel Eilon & I. G. Chowdhury, 1977. "Minimising Waiting Time Variance in the Single Machine Problem," Management Science, INFORMS, vol. 23(6), pages 567-575, February.
    7. John J. Kanet, 1981. "Minimizing Variation of Flow Time in Single Machine Systems," Management Science, INFORMS, vol. 27(12), pages 1453-1459, December.
    8. Bruce Faaland & Tom Schmitt, 1987. "Scheduling Tasks with Due Dates in a Fabrication/Assembly Process," Operations Research, INFORMS, vol. 35(3), pages 378-388, June.
    9. Nicholas G. Hall, 1986. "Single‐ and multiple‐processor models for minimizing completion time variance," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(1), pages 49-54, February.
    10. John J. Kanet, 1981. "Minimizing the average deviation of job completion times about a common due date," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(4), pages 643-651, December.
    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. David J. Robb & Thomas R. Rohleder, 1996. "An evaluation of scheduling heuristics for dynamic single‐processor scheduling with early/tardy costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 349-364, April.
    2. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
    3. T. Ibaraki & S. Imahori & M. Kubo & T. Masuda & T. Uno & M. Yagiura, 2005. "Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints," Transportation Science, INFORMS, vol. 39(2), pages 206-232, May.
    4. Jaw‐Yeh Chen & Sheng‐Fuu Lin, 2002. "Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(8), pages 760-780, December.
    5. Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
    6. N Nekoiemehr & G Moslehi, 2011. "Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1403-1412, July.
    7. Tan, Zhen & Fu, Guanqi, 2024. "Just-in-time scheduling problem with affine idleness cost," European Journal of Operational Research, Elsevier, vol. 313(3), pages 954-976.
    8. Schaller, Jeffrey & Valente, Jorge M.S., 2020. "Minimizing total earliness and tardiness in a nowait flow shop," International Journal of Production Economics, Elsevier, vol. 224(C).
    9. Yeong‐Dae Kim & Candace Arai Yano, 1994. "Minimizing mean tardiness and earliness in single‐machine scheduling problems with unequal due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 913-933, December.
    10. Wlodzimierz Szwarc & Samar K. Mukhopadhyay, 1995. "Optimal timing schedules in earliness‐tardiness single machine sequencing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1109-1114, October.
    11. Guang Feng & Hoong Lau, 2008. "Efficient algorithms for machine scheduling problems with earliness and tardiness penalties," Annals of Operations Research, Springer, vol. 159(1), pages 83-95, March.

    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. Gur Mosheiov, 2000. "Minimizing mean absolute deviation of job completion times from the mean completion time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 657-668, December.
    2. Y. P. Aneja & S. N. Kabadi & A. Nagar, 1998. "Minimizing weighted mean absolute deviation of flow times in single machine systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 297-311, April.
    3. Cai, X., 1995. "Minimization of agreeably weighted variance in single machine systems," European Journal of Operational Research, Elsevier, vol. 85(3), pages 576-592, September.
    4. Uttarayan Bagchi & Yih‐Long Chang & Robert S. Sullivan, 1987. "Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 739-751, October.
    5. Wang, Ji-Bo & Xia, Zun-Quan, 2007. "Single machine scheduling problems with controllable processing times and total absolute differences penalties," European Journal of Operational Research, Elsevier, vol. 177(1), pages 638-645, February.
    6. Cai, X., 1996. "V-shape property for job sequences that minimize the expected completion time variance," European Journal of Operational Research, Elsevier, vol. 91(1), pages 118-123, May.
    7. C.T. Ng & X. Cai & T.C.E. Cheng, 1999. "Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 373-398, June.
    8. Koulamas, Christos & Kyparisis, George J., 2023. "Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection," European Journal of Operational Research, Elsevier, vol. 305(2), pages 608-616.
    9. Weng, Xiaohua & Ventura, Jose A., 1996. "Scheduling about a given common due date to minimize mean squared deviation of completion times," European Journal of Operational Research, Elsevier, vol. 88(2), pages 328-335, January.
    10. Seo, Jong Hwa & Kim, Chae-Bogk & Lee, Dong Hoon, 2001. "Minimizing mean squared deviation of completion times with maximum tardiness constraint," European Journal of Operational Research, Elsevier, vol. 129(1), pages 95-104, February.
    11. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    12. Awi Federgruen & Gur Mosheiov, 1993. "Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(7), pages 951-970, December.
    13. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
    14. Nasini, Stefano & Nessah, Rabia, 2024. "Time-flexible min completion time variance in a single machine by quadratic programming," European Journal of Operational Research, Elsevier, vol. 312(2), pages 427-444.
    15. Srirangacharyulu, B. & Srinivasan, G., 2013. "An exact algorithm to minimize mean squared deviation of job completion times about a common due date," European Journal of Operational Research, Elsevier, vol. 231(3), pages 547-556.
    16. V. Rajendra Prasad & D. K. Manna, 1997. "Minimization of expected variance of completion times on single machine for stochastic jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 97-108, February.
    17. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.
    18. Michael C. Ferris & Milan Vlach, 1992. "Scheduling with earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 229-245, March.
    19. G Mosheiov, 2008. "Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1422-1424, October.
    20. Enrique Gerstl & Gur Mosheiov, 2014. "Single machine just‐in‐time scheduling problems with two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 1-16, 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:wly:navres:v:40:y:1993:i:1:p:85-101. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.