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

A note on An efficient algorithm for the single-machine tardiness problem

Author

Listed:
  • Biskup, Dirk
  • Piewitt, Wolfgang

Abstract

No abstract is available for this item.

Suggested Citation

  • Biskup, Dirk & Piewitt, Wolfgang, 2000. "A note on An efficient algorithm for the single-machine tardiness problem," International Journal of Production Economics, Elsevier, vol. 66(3), pages 287-292, July.
    • Handle: RePEc:eee:proeco:v:66:y:2000:i:3:p:287-292
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(00)00014-1
    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. Hamilton Emmons, 1969. "One-Machine Sequencing to Minimize Certain Functions of Job Tardiness," Operations Research, INFORMS, vol. 17(4), pages 701-715, August.
    2. Kondakci, Suna & Kirca, Omer & Azizoglu, Meral, 1994. "An efficient algorithm for the single machine tardiness problem," International Journal of Production Economics, Elsevier, vol. 36(2), pages 213-219, September.
    3. 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.
    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. 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. Chang, Pei-Chann & Hsieh, Jih-Chang & Liu, Chen-Hao, 2006. "A case-injected genetic algorithm for single machine scheduling problems with release time," International Journal of Production Economics, Elsevier, vol. 103(2), pages 551-564, October.

    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. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, 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. 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.
    4. 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.
    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. 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.
    7. J. J. Kanet, 2007. "New Precedence Theorems for One-Machine Weighted Tardiness," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 579-588, August.
    8. 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.
    9. Tanaka, Shunji & Sato, Shun, 2013. "An exact algorithm for the precedence-constrained single-machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 345-352.
    10. Koulamas, Christos & Kyparisis, George J., 2019. "New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives," European Journal of Operational Research, Elsevier, vol. 278(1), pages 149-159.
    11. 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.
    12. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    13. Yagiura, Mutsunori & Ibaraki, Toshihide, 1996. "The use of dynamic programming in genetic algorithms for permutation problems," European Journal of Operational Research, Elsevier, vol. 92(2), pages 387-401, July.
    14. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    15. Liaw, Ching-Fang, 2005. "Scheduling preemptive open shops to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 162(1), pages 173-183, April.
    16. Scholl, Armin & Becker, Christian, 2005. "A note on "An exact method for cost-oriented assembly line balancing"," International Journal of Production Economics, Elsevier, vol. 97(3), pages 343-352, September.
    17. 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.
    18. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
    19. Scholl, Armin & Klein, Robert, 1999. "Balancing assembly lines effectively - A computational comparison," European Journal of Operational Research, Elsevier, vol. 114(1), pages 50-58, April.
    20. Bukchin, Yossi & Raviv, Tal, 2018. "Constraint programming for solving various assembly line balancing problems," Omega, Elsevier, vol. 78(C), pages 57-68.

    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:66:y:2000:i:3:p:287-292. 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.