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

A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times

Author

Listed:
  • Choobineh, F. Fred
  • Mohebbi, Esmail
  • Khoo, Hansen

Abstract

No abstract is available for this item.

Suggested Citation

  • Choobineh, F. Fred & Mohebbi, Esmail & Khoo, Hansen, 2006. "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 175(1), pages 318-337, November.
    • Handle: RePEc:eee:ejores:v:175:y:2006:i:1:p:318-337
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00452-2
    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. Sarker, Ruhul & Liang, Ko-Hsin & Newton, Charles, 2002. "A new multiobjective evolutionary algorithm," European Journal of Operational Research, Elsevier, vol. 140(1), pages 12-23, July.
    2. Chand, Suresh & Schneeberger, Hans, 1988. "Single machine scheduling to minimize weighted earliness subject to no tardy jobs," European Journal of Operational Research, Elsevier, vol. 34(2), pages 221-230, March.
    3. J. Wesley Barnes & Lawrence K. Vanston, 1981. "Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs," Operations Research, INFORMS, vol. 29(1), pages 146-160, February.
    4. Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
    5. Fink, Andreas & Vo[ss], Stefan, 2003. "Solving the continuous flow-shop scheduling problem by metaheuristics," European Journal of Operational Research, Elsevier, vol. 151(2), pages 400-414, December.
    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. Jones, D. F. & Mirrazavi, S. K. & Tamiz, M., 2002. "Multi-objective meta-heuristics: An overview of the current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 137(1), pages 1-9, February.
    8. Franca, Paulo M. & Gendreau, Michel & Laporte, Gilbert & Muller, Felipe M., 1996. "A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 79-89, 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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Hanen Akrout & Bassem Jarboui & Patrick Siarry & Abdelwaheb Rebaï, 2012. "A GRASP based on DE to solve single machine scheduling problem with SDST," Computational Optimization and Applications, Springer, vol. 51(1), pages 411-435, January.
    3. Yiyo Kuo & Sheng-I Chen & Yen-Hung Yeh, 2020. "Single machine scheduling with sequence-dependent setup times and delayed precedence constraints," Operational Research, Springer, vol. 20(2), pages 927-942, June.
    4. S. H. Nasseri & M. H. Khaviari, 2011. "Solving TSP by considering processing time: Meta-heuristics and fuzzy approaches," Fuzzy Information and Engineering, Springer, vol. 3(4), pages 359-378, December.

    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. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    2. Shyamal Gondkar & Sivakumar Sreeramagiri & Edwin Zondervan, 2012. "Methodology for Assessment and Optimization of Industrial Eco-Systems," Challenges, MDPI, vol. 3(1), pages 1-21, June.
    3. Zhou, Liping & Geng, Na & Jiang, Zhibin & Wang, Xiuxian, 2018. "Multi-objective capacity allocation of hospital wards combining revenue and equity," Omega, Elsevier, vol. 81(C), pages 220-233.
    4. Konak, Abdullah & Coit, David W. & Smith, Alice E., 2006. "Multi-objective optimization using genetic algorithms: A tutorial," Reliability Engineering and System Safety, Elsevier, vol. 91(9), pages 992-1007.
    5. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.
    6. Tan, K.C. & Goh, C.K. & Yang, Y.J. & Lee, T.H., 2006. "Evolving better population distribution and exploration in evolutionary multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 171(2), pages 463-495, June.
    7. Stefan Voßs & Andreas Fink & Cees Duin, 2005. "Looking Ahead with the Pilot Method," Annals of Operations Research, Springer, vol. 136(1), pages 285-302, April.
    8. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    9. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    10. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    11. Furini, Fabio & Persiani, Carlo Alfredo & Toth, Paolo, 2016. "The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 38-55.
    12. Surafel Luleseged Tilahun & Mohamed A. Tawhid, 2019. "Swarm hyperheuristic framework," Journal of Heuristics, Springer, vol. 25(4), pages 809-836, October.
    13. T. Gómez & M. Hernández & J. Molina & M. León & E. Aldana & R. Caballero, 2011. "A multiobjective model for forest planning with adjacency constraints," Annals of Operations Research, Springer, vol. 190(1), pages 75-92, October.
    14. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    15. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    16. Alves, Maria João & Costa, João Paulo, 2009. "An exact method for computing the nadir values in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 198(2), pages 637-646, October.
    17. Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
    18. Rivera, Juan Carlos & Murat Afsar, H. & Prins, Christian, 2016. "Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 249(1), pages 93-104.
    19. Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.
    20. Koronakos, Gregory & Sotiros, Dimitris & Despotis, Dimitris K. & Kritikos, Manolis N., 2022. "Fair efficiency decomposition in network DEA: A compromise programming approach," Socio-Economic Planning Sciences, Elsevier, vol. 79(C).

    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:175:y:2006:i:1:p:318-337. 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.