IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v176y2007i3p1423-1435.html
   My bibliography  Save this article

A tabu search algorithm for the single machine total weighted tardiness problem

Author

Listed:
  • Bilge, Umit
  • Kurtulan, Mujde
  • Kirac, Furkan

Abstract

No abstract is available for this item.

Suggested Citation

  • Bilge, Umit & Kurtulan, Mujde & Kirac, Furkan, 2007. "A tabu search algorithm for the single machine total weighted tardiness problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1423-1435, February.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:3:p:1423-1435
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00856-8
    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. Chris N. Potts & Luk N. Van Wassenhove, 1985. "A Branch and Bound Algorithm for the Total Weighted Tardiness Problem," Operations Research, INFORMS, vol. 33(2), pages 363-377, April.
    2. 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.
    3. Richard K. Congram & Chris N. Potts & Steef L. van de Velde, 2002. "An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 52-67, February.
    4. Tian, Z. J. & Ng, C. T. & Cheng, T. C. E., 2005. "On the single machine total tardiness problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 843-846, September.
    5. 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.
    6. 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.
    7. Christos Koulamas, 1994. "The Total Tardiness Problem: Review and Extensions," Operations Research, INFORMS, vol. 42(6), pages 1025-1041, December.
    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. Chen, Wenchong & Gong, Xuejian & Rahman, Humyun Fuad & Liu, Hongwei & Qi, Ershi, 2021. "Real-time order acceptance and scheduling for data-enabled permutation flow shops: Bilevel interactive optimization with nonlinear integer programming," Omega, Elsevier, vol. 105(C).
    2. 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.
    3. Geiger, Martin Josef, 2010. "On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1235-1243, December.
    4. Rejab Hajlaoui & Eesa Alsolami & Tarek Moulahi & Hervé Guyennet, 2019. "Construction of a stable vehicular ad hoc network based on hybrid genetic algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 71(3), pages 433-445, July.

    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. 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.
    3. 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.
    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. 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.
    6. 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.
    7. Alidaee, Bahram & Kochenberger, Gary A. & Amini, Mohammad M., 2001. "Greedy solutions of selection and ordering problems," European Journal of Operational Research, Elsevier, vol. 134(1), pages 203-215, October.
    8. 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.
    9. Christos Koulamas, 1997. "Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 109-125, February.
    10. 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.
    11. 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.
    12. 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.
    13. Gio Kao & Edward Sewell & Sheldon Jacobson & Shane Hall, 2012. "New dominance rules and exploration strategies for the 1|r i |∑U i scheduling problem," Computational Optimization and Applications, Springer, vol. 51(3), pages 1253-1274, April.
    14. 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.
    15. 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.
    16. Angel, E. & Bampis, E., 2005. "A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem," European Journal of Operational Research, Elsevier, vol. 162(1), pages 281-289, April.
    17. Sesh Murthy & Rama Akkiraju & Richard Goodwin & Pinar Keskinocak & John Rachlin & Frederick Wu & James Yeh & Robert Fuhrer & Santhosh Kumaran & Alok Aggarwal & Martin Sturzenbecker & Ranga Jayaraman &, 1999. "Cooperative Multiobjective Decision Support for the Paper Industry," Interfaces, INFORMS, vol. 29(5), pages 5-30, October.
    18. 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.
    19. Yang, Bibo & Geunes, Joseph, 2008. "Predictive-reactive scheduling on a single resource with uncertain future jobs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1267-1283, September.
    20. O Holthaus & C Rajendran, 2005. "A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 947-953, August.

    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:ejores:v:176:y:2007:i:3:p:1423-1435. 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/eor .

    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.