IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v27y1999i4p485-495.html
   My bibliography  Save this article

An improved heuristic for the single-machine, weighted-tardiness problem

Author

Listed:
  • Holsenback, J. E.
  • Russell, R. M.
  • Markland, R. E.
  • Philipoom, P. R.

Abstract

This research considers the single machine, total weighted-tardiness problem. We propose a method for modifying due dates that eases the construction of optimal schedules. We employ due date modification in a new heuristic that is fast, solving 50-job problems on an IBM 4381 in at most 0.14 CPU s. The heuristic is shown to be superior to previously known heuristics in minimizing total weighted-tardiness, especially in settings where 40% or more of the jobs can be completed without tardiness on the single machine.

Suggested Citation

  • Holsenback, J. E. & Russell, R. M. & Markland, R. E. & Philipoom, P. R., 1999. "An improved heuristic for the single-machine, weighted-tardiness problem," Omega, Elsevier, vol. 27(4), pages 485-495, August.
    • Handle: RePEc:eee:jomega:v:27:y:1999:i:4:p:485-495
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(98)00072-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Kenneth R. Baker & Linus E. Schrage, 1978. "Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks," Operations Research, INFORMS, vol. 26(1), pages 111-120, February.
    2. Robert J. Chambers & Robert L. Carraway & Timothy J. Lowe & Thomas L. Morin, 1991. "Dominance and Decomposition Heuristics for Single Machine Scheduling," Operations Research, INFORMS, vol. 39(4), pages 639-647, August.
    3. A. H. G. Rinnooy Kan & B. J. Lageweg & J. K. Lenstra, 1975. "Minimizing Total Costs in One-Machine Scheduling," Operations Research, INFORMS, vol. 23(5), pages 908-927, October.
    4. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    5. Albert Schild & Irwin J. Fredman, 1961. "On Scheduling Tasks with Associated Linear Loss Functions," Management Science, INFORMS, vol. 7(3), pages 280-285, April.
    6. Joel Shwimer, 1972. "On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution," Management Science, INFORMS, vol. 18(6), pages 301-313, February.
    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. Cheng, T. C. E. & Ng, C. T. & Yuan, J. J. & Liu, Z. H., 2005. "Single machine scheduling to minimize total weighted tardiness," European Journal of Operational Research, Elsevier, vol. 165(2), pages 423-443, September.
    2. Valente, Jorge M.S., 2007. "Improving the performance of the ATC dispatch rule by using workload data to determine the lookahead parameter value," International Journal of Production Economics, Elsevier, vol. 106(2), pages 563-573, April.
    3. Maria Raquel C. Costa & Jorge M. S. Valente & Jeffrey E. Schaller, 2020. "Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 487-522, September.

    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. 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.
    2. Sen, Tapan & Sulek, Joanne M. & Dileepan, Parthasarati, 2003. "Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey," International Journal of Production Economics, Elsevier, vol. 83(1), pages 1-12, January.
    3. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    4. Valente, Jorge M.S., 2007. "Improving the performance of the ATC dispatch rule by using workload data to determine the lookahead parameter value," International Journal of Production Economics, Elsevier, vol. 106(2), pages 563-573, April.
    5. Louis-Philippe Bigras & Michel Gamache & Gilles Savard, 2008. "Time-Indexed Formulations and the Total Weighted Tardiness Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 133-142, February.
    6. John J. Kanet, 2014. "One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons," Operations Research, INFORMS, vol. 62(2), pages 345-347, April.
    7. Ben-Daya, M. & Duffuaa, S. O. & Raouf, A., 1996. "Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine," European Journal of Operational Research, Elsevier, vol. 89(1), pages 100-107, February.
    8. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    9. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    10. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    11. Haiyan Wang & Chung‐Yee Lee, 2005. "Production and transport logistics scheduling with two transport mode choices," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 796-809, December.
    12. Vink, Wouter & Kuiper, Alex & Kemper, Benjamin & Bhulai, Sandjai, 2015. "Optimal appointment scheduling in continuous time: The lag order approximation method," European Journal of Operational Research, Elsevier, vol. 240(1), pages 213-219.
    13. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    14. Leah Epstein, 2023. "Parallel solutions for preemptive makespan scheduling on two identical machines," Journal of Scheduling, Springer, vol. 26(1), pages 61-76, February.
    15. Djellab, Housni & Djellab, Khaled, 2002. "Preemptive Hybrid Flowshop Scheduling problem of interval orders," European Journal of Operational Research, Elsevier, vol. 137(1), pages 37-49, February.
    16. Han, Bin & Zhang, Wenjun & Lu, Xiwen & Lin, Yingzi, 2015. "On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost," European Journal of Operational Research, Elsevier, vol. 244(3), pages 704-714.
    17. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
    18. Chen, Lin & Ye, Deshi & Zhang, Guochuan, 2018. "Parallel machine scheduling with speed-up resources," European Journal of Operational Research, Elsevier, vol. 268(1), pages 101-112.
    19. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    20. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.

    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:eee:jomega:v:27:y:1999:i:4:p:485-495. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.