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. 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.
    2. 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.
    3. George Li, 1997. "Single machine earliness and tardiness scheduling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 546-558, February.
    4. 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.
    5. Peng Si Ow, 1985. "Focused Scheduling in Proportionate Flowshops," Management Science, INFORMS, vol. 31(7), pages 852-869, July.
    6. 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.
    7. 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.
    8. 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.
    9. Koulamas, C., 1997. "Polynomially solvable total tardiness problems: Review and extensions," Omega, Elsevier, vol. 25(2), pages 235-239, April.
    10. 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.
    11. Eugene L. Lawler, 1964. "On Scheduling Problems with Deferral Costs," Management Science, INFORMS, vol. 11(2), pages 280-288, November.
    12. Azizoglu, Meral & Kirca, Omer, 1998. "Tardiness minimization on parallel machines," International Journal of Production Economics, Elsevier, vol. 55(2), pages 163-168, July.
    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. 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.
    15. 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.
    16. Albert Schild & Irwin J. Fredman, 1961. "On Scheduling Tasks with Associated Linear Loss Functions," Management Science, INFORMS, vol. 7(3), pages 280-285, April.
    17. 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.
    18. Wlodzimierz Szwarc & John J. Liu, 1993. "Weighted Tardiness Single Machine Scheduling with Proportional Weights," Management Science, INFORMS, vol. 39(5), pages 626-632, May.
    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. 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.
    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. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    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.

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.