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

An evaluation of scheduling heuristics for dynamic single‐processor scheduling with early/tardy costs

Author

Listed:
  • David J. Robb
  • Thomas R. Rohleder

Abstract

In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:43:y:1996:i:3:p:349-364
    DOI: 10.1002/(SICI)1520-6750(199604)43:33.0.CO;2-9
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199604)43:33.0.CO;2-9
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199604)43:33.0.CO;2-9?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. Taillard, E., 1990. "Some efficient heuristic methods for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 47(1), pages 65-74, July.
    2. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    3. Stephen C. Graves, 1981. "A Review of Production Scheduling," Operations Research, INFORMS, vol. 29(4), pages 646-675, August.
    4. 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.
    5. Morton, T.E. & Singh, M., 1988. "Implicit Costs And Prices For Resources With Busy Periods," GSIA Working Papers 88-89-02, Carnegie Mellon University, Tepper School of Business.
    6. Peng Si Ow & Thomas E. Morton, 1989. "The Single Machine Early/Tardy Problem," Management Science, INFORMS, vol. 35(2), pages 177-191, February.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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).
    3. Xia, Yu & Chen, Bintong & Yue, Jinfeng, 2008. "Job sequencing and due date assignment in a single machine shop with uncertain processing times," European Journal of Operational Research, Elsevier, vol. 184(1), pages 63-75, January.
    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. James, R. J. W. & Buchanan, J. T., 1997. "A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 513-527, November.
    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. Franca, Paulo M. & Mendes, Alexandre & Moscato, Pablo, 2001. "A memetic algorithm for the total tardiness single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 224-242, July.
    8. Valente, Jorge M.S. & Alves, Rui A.F.S., 2007. "Heuristics for the early/tardy scheduling problem with release dates," International Journal of Production Economics, Elsevier, vol. 106(1), pages 261-274, March.
    9. repec:dgr:rugsom:95a37 is not listed on IDEAS
    10. 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.
    11. Mazzini, Renata & Armentano, Vinicius A., 2001. "A heuristic for single machine scheduling with early and tardy costs," European Journal of Operational Research, Elsevier, vol. 128(1), pages 129-146, January.
    12. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    13. Kate, H.A. ten & Wijngaard, J. & Zijm, W.H.M., 1995. "Minimizing weighted total earliness, total tardiness and setup costs," Research Report 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    14. Ventura, Jose A. & Radhakrishnan, Sanjay, 2003. "Single machine scheduling with symmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 144(3), pages 598-612, February.
    15. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    16. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    17. Victor Portougal & David J. Robb, 2000. "Production Scheduling Theory: Just Where Is It Applicable?," Interfaces, INFORMS, vol. 30(6), pages 64-76, December.
    18. James, R. J. W. & Buchanan, J. T., 1998. "Performance enhancements to tabu search for the early/tardy scheduling problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 254-265, April.
    19. George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
    20. Ho, Johnny C. & Chang, Yih-Long, 1995. "Minimizing the number of tardy jobs for m parallel machines," European Journal of Operational Research, Elsevier, vol. 84(2), pages 343-355, July.
    21. Pathumnakul, Supachai & Egbelu, Pius J., 2005. "Algorithm for minimizing weighted earliness penalty in single-machine problem," European Journal of Operational Research, Elsevier, vol. 161(3), pages 780-796, March.

    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:43:y:1996:i:3:p:349-364. 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.