IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v83y2003i1p1-12.html
   My bibliography  Save this article

Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey

Author

Listed:
  • Sen, Tapan
  • Sulek, Joanne M.
  • Dileepan, Parthasarati

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:83:y:2003:i:1:p:1-12
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(02)00265-7
    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. H. A. J. Crauwels & C. N. Potts & L. N. Van Wassenhove, 1998. "Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 341-350, August.
    2. Azizoglu, Meral & Kirca, Omer, 1998. "Tardiness minimization on parallel machines," International Journal of Production Economics, Elsevier, vol. 55(2), pages 163-168, July.
    3. Esther M. Arkin & Robin O. Roundy, 1991. "Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights," Operations Research, INFORMS, vol. 39(1), pages 64-81, February.
    4. Panwalkar, S. S. & Smith, M. L. & Koulamas, C. P., 1993. "A heuristic for the single machine tardiness problem," European Journal of Operational Research, Elsevier, vol. 70(3), pages 304-310, November.
    5. Edward P. C. Kao & Maurice Queyranne, 1982. "On Dynamic Programming Methods for Assembly Line Balancing," Operations Research, INFORMS, vol. 30(2), pages 375-390, April.
    6. Jean-Claude Picard & Maurice Queyranne, 1978. "The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling," Operations Research, INFORMS, vol. 26(1), pages 86-110, February.
    7. Ibaraki, Toshihide & Nakamura, Yuichi, 1994. "A dynamic programming method for single machine scheduling," European Journal of Operational Research, Elsevier, vol. 76(1), pages 72-82, July.
    8. Wlodzimierz Szwarc & John J. Liu, 1993. "Weighted Tardiness Single Machine Scheduling with Proportional Weights," Management Science, INFORMS, vol. 39(5), pages 626-632, May.
    9. George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
    10. Sridharan, V. & Zhou, Z., 1996. "A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 292-301, October.
    11. Linus Schrage & Kenneth R. Baker, 1978. "Dynamic Programming Solution of Sequencing Problems with Precedence Constraints," Operations Research, INFORMS, vol. 26(3), pages 444-449, June.
    12. Eugene L. Lawler, 1964. "On Scheduling Problems with Deferral Costs," Management Science, INFORMS, vol. 11(2), pages 280-288, November.
    13. Russell, Randolph M. & Holsenback, J. Edward, 1997. "Evaluation of leading heuristics for the single machine tardiness problem," European Journal of Operational Research, Elsevier, vol. 96(3), pages 538-545, February.
    14. 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.
    15. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "Complexity results for scheduling chains on a single machine," European Journal of Operational Research, Elsevier, vol. 4(4), pages 270-275, April.
    16. 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.
    17. Potts, C.N. & Van Wassenhove, L.N., 1987. "Dynamic programming and decomposition approaches for the single machine total tardiness problem," European Journal of Operational Research, Elsevier, vol. 32(3), pages 405-414, December.
    18. Alidaee, Bahram & Gopalan, Suresh, 1997. "A note on the equivalence of two heuristics to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 96(3), pages 514-517, February.
    19. Koulamas, C., 1997. "Polynomially solvable total tardiness problems: Review and extensions," Omega, Elsevier, vol. 25(2), pages 235-239, April.
    20. A. Federgruen & G. Mosheiov, 1997. "Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs," Operations Research, INFORMS, vol. 45(1), pages 66-71, February.
    21. Hamilton Emmons, 1969. "One-Machine Sequencing to Minimize Certain Functions of Job Tardiness," Operations Research, INFORMS, vol. 17(4), pages 701-715, August.
    22. Sabuncuoglu, Ihsan & Gurgun, Burckaan, 1996. "A neural network model for scheduling problems," European Journal of Operational Research, Elsevier, vol. 93(2), pages 288-299, September.
    23. Ben-Daya, M. & Al-Fawzan, M., 1996. "A simulated annealing approach for the one-machine mean tardiness scheduling problem," European Journal of Operational Research, Elsevier, vol. 93(1), pages 61-67, August.
    24. Peng Si Ow, 1985. "Focused Scheduling in Proportionate Flowshops," Management Science, INFORMS, vol. 31(7), pages 852-869, July.
    25. 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.
    26. 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.
    27. Albert Schild & Irwin J. Fredman, 1961. "On Scheduling Tasks with Associated Linear Loss Functions," Management Science, INFORMS, vol. 7(3), pages 280-285, April.
    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. J. J. Kanet, 2007. "New Precedence Theorems for One-Machine Weighted Tardiness," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 579-588, August.
    2. Herr, Oliver & Goel, Asvin, 2016. "Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints," European Journal of Operational Research, Elsevier, vol. 248(1), pages 123-135.
    3. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.
    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. Pathumnakul, Supachai & Egbelu, Pius J., 2006. "An algorithm for minimizing weighted earliness penalty in assembly job shops," International Journal of Production Economics, Elsevier, vol. 103(1), pages 230-245, September.
    6. S H Yoon & I S Lee, 2011. "New constructive heuristics for the total weighted tardiness problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 232-237, January.
    7. X Wang & L Tang, 2011. "Scheduling a single machine with multiple job processing ability to minimize makespan," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1555-1565, August.
    8. Fernando Jaramillo & Busra Keles & Murat Erkoc, 2020. "Modeling single machine preemptive scheduling problems for computational efficiency," Annals of Operations Research, Springer, vol. 285(1), pages 197-222, February.
    9. Biskup, Dirk & Herrmann, Jan & Gupta, Jatinder N.D., 2008. "Scheduling identical parallel machines to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 115(1), pages 134-142, September.
    10. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    11. Huynh Tuong, Nguyen & Soukhal, Ameur & Billaut, Jean-Charles, 2010. "A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines," European Journal of Operational Research, Elsevier, vol. 202(3), pages 646-653, May.
    12. Andreas C. Nearchou, 2018. "Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm," Journal of Heuristics, Springer, vol. 24(6), pages 817-851, December.
    13. Halil Şen & Kerem Bülbül, 2015. "A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 135-150, February.
    14. Jorge M. S. Valente, 2005. "Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups," FEP Working Papers 186, Universidade do Porto, Faculdade de Economia do Porto.
    15. 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.
    16. Armentano, Vinicius Amaral & de Franca Filho, Moacir Felizardo, 2007. "Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach," European Journal of Operational Research, Elsevier, vol. 183(1), pages 100-114, November.
    17. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.

    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. Koulamas, Christos, 2010. "The single-machine total tardiness scheduling problem: Review and extensions," European Journal of Operational Research, Elsevier, vol. 202(1), pages 1-7, April.
    2. 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.
    3. 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.
    4. J. J. Kanet, 2007. "New Precedence Theorems for One-Machine Weighted Tardiness," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 579-588, August.
    5. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2000. "Sequencing jobs on a single machine: A neural network approach," European Journal of Operational Research, Elsevier, vol. 126(3), pages 474-490, November.
    6. Akturk, M. Selim & Ozdemir, Deniz, 2001. "A new dominance rule to minimize total weighted tardiness with unequal release dates," European Journal of Operational Research, Elsevier, vol. 135(2), pages 394-412, December.
    7. Yalaoui, Farouk & Chu, Chengbin, 2002. "Parallel machine scheduling to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 76(3), pages 265-279, April.
    8. Rostami, Salim & Creemers, Stefan & Leus, Roel, 2019. "Precedence theorems and dynamic programming for the single-machine weighted tardiness problem," European Journal of Operational Research, Elsevier, vol. 272(1), pages 43-49.
    9. Su, Ling-Huey & Chen, Chung-Jung, 2008. "Minimizing total tardiness on a single machine with unequal release dates," European Journal of Operational Research, Elsevier, vol. 186(2), pages 496-503, April.
    10. Adenso-Diaz, Belarmino, 1996. "An SA/TS mixture algorithm for the scheduling tardiness problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 516-524, February.
    11. Tanaka, Shunji & Araki, Mituhiko, 2008. "A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines," International Journal of Production Economics, Elsevier, vol. 113(1), pages 446-458, May.
    12. Russell, Randolph M. & Holsenback, J. Edward, 1997. "Evaluation of leading heuristics for the single machine tardiness problem," European Journal of Operational Research, Elsevier, vol. 96(3), pages 538-545, February.
    13. Shim, Sang-Oh & Kim, Yeong-Dae, 2007. "Scheduling on parallel identical machines to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 177(1), pages 135-146, February.
    14. Biskup, Dirk & Herrmann, Jan & Gupta, Jatinder N.D., 2008. "Scheduling identical parallel machines to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 115(1), pages 134-142, September.
    15. S-O Shim & Y-D Kim, 2007. "Minimizing total tardiness in an unrelated parallel-machine scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 346-354, March.
    16. Naidu, Jaideep T., 2003. "A note on a well-known dispatching rule to minimize total tardiness," Omega, Elsevier, vol. 31(2), pages 137-140, April.
    17. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    18. 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.
    19. Tan, K. C. & Narasimhan, R., 1997. "Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach," Omega, Elsevier, vol. 25(6), pages 619-634, December.
    20. Chen, Jeng-Fung & Wu, Tai-Hsi, 2006. "Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints," Omega, Elsevier, vol. 34(1), pages 81-89, January.

    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:eee:proeco:v:83:y:2003:i:1:p:1-12. 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/locate/ijpe .

    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.