IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v64y2000i1-3p165-176.html
   My bibliography  Save this article

A new heuristic based on a hypergraph representation for the tool switching problem

Author

Listed:
  • Djellab, Housni
  • Djellab, Khaled
  • Gourgand, Michel

Abstract

No abstract is available for this item.

Suggested Citation

  • Djellab, Housni & Djellab, Khaled & Gourgand, Michel, 2000. "A new heuristic based on a hypergraph representation for the tool switching problem," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 165-176, March.
    • Handle: RePEc:eee:proeco:v:64:y:2000:i:1-3:p:165-176
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(99)00055-9
    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. Christopher S. Tang & Eric V. Denardo, 1988. "Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches," Operations Research, INFORMS, vol. 36(5), pages 767-777, October.
    2. Crama, Y. & van de Klundert, J., 1996. "The approximability of tool management problems," Research Memorandum 034, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Crama Yves & Klundert Joris van de, 1996. "The approximability of tool management problems," Research Memorandum 019, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    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. Steven Harrod, 2011. "Modeling Network Transition Constraints with Hypergraphs," Transportation Science, INFORMS, vol. 45(1), pages 81-97, February.
    2. Dang, Quang-Vinh & van Diessen, Thijs & Martagan, Tugce & Adan, Ivo, 2021. "A matheuristic for parallel machine scheduling with tool replacements," European Journal of Operational Research, Elsevier, vol. 291(2), pages 640-660.
    3. Van Hop, Nguyen & Nagarur, Nagendra N., 2004. "The scheduling problem of PCBs for multiple non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 158(3), pages 577-594, November.
    4. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    5. Raduly-Baka, Csaba & Nevalainen, Olli S., 2015. "The modular tool switching problem," European Journal of Operational Research, Elsevier, vol. 242(1), pages 100-106.
    6. Crama, Yves & Moonen, Linda S. & Spieksma, Frits C.R. & Talloen, Ellen, 2007. "The tool switching problem revisited," European Journal of Operational Research, Elsevier, vol. 182(2), pages 952-957, October.
    7. Hirvikorpi, Mika & Salonen, Kari & Knuutila, Timo & Nevalainen, Olli S., 2006. "The general two-level storage management problem: A reconsideration of the KTNS-rule," European Journal of Operational Research, Elsevier, vol. 171(1), pages 189-207, May.

    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. Hirvikorpi, Mika & Salonen, Kari & Knuutila, Timo & Nevalainen, Olli S., 2006. "The general two-level storage management problem: A reconsideration of the KTNS-rule," European Journal of Operational Research, Elsevier, vol. 171(1), pages 189-207, May.
    2. Crama, Yves, 1997. "Combinatorial optimization models for production scheduling in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 136-153, May.
    3. Knuutila, Timo & Nevalainen, Olli, 2002. "A reduction technique for weighted grouping problems," European Journal of Operational Research, Elsevier, vol. 140(3), pages 590-605, August.
    4. Yves Crama & Joris van de Klundert, 1999. "Worst‐case performance of approximation algorithms for tool management problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 445-462, August.
    5. Akhundov, Najmaddin & Ostrowski, James, 2024. "Exploiting symmetry for the job sequencing and tool switching problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 976-987.
    6. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    7. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.
    8. Christopher S. Tang, 2017. "OM Forum—Three Simple Approaches for Young Scholars to Identify Relevant and Novel Research Topics in Operations Management," Manufacturing & Service Operations Management, INFORMS, vol. 19(3), pages 338-346, July.
    9. Nagraj Balakrishnan & Amiya K. Chakravarty, 2001. "Opportunistic retooling of a flexible machine subject to failure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(1), pages 79-97, February.
    10. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    11. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    12. Chakravarty, Amiya K. & Balakrishnan, Nagraj, 1997. "Job sequencing rules for minimizing the expected makespan in flexible machines," European Journal of Operational Research, Elsevier, vol. 96(2), pages 274-288, January.
    13. Matzliach, Barouch & Tzur, Michal, 2000. "Storage management of items in two levels of availability," European Journal of Operational Research, Elsevier, vol. 121(2), pages 363-379, March.
    14. Dang, Quang-Vinh & van Diessen, Thijs & Martagan, Tugce & Adan, Ivo, 2021. "A matheuristic for parallel machine scheduling with tool replacements," European Journal of Operational Research, Elsevier, vol. 291(2), pages 640-660.
    15. Ciavotta, Michele & Detti, Paolo & Meloni, Carlo & Pranzo, Marco, 2008. "A bi-objective coordination setup problem in a two-stage production system," European Journal of Operational Research, Elsevier, vol. 189(3), pages 734-745, September.
    16. M. Selim Akturk & Jay B. Ghosh & Evrim D. Gunes, 2003. "Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 15-30, February.
    17. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    18. Gronalt, M. & Grunow, M. & Gunther, H. O. & Zeller, R., 1997. "A heuristic for component switching on SMT placement machines," International Journal of Production Economics, Elsevier, vol. 53(2), pages 181-190, November.
    19. Liao, Ching-Jong & Shyu, Cian-Ci & Tseng, Chao-Tang, 2009. "A least flexibility first heuristic to coordinate setups in a two- or three-stage supply chain," International Journal of Production Economics, Elsevier, vol. 117(1), pages 127-135, January.
    20. Moshe Dror & Mohamed Haouari, 2000. "Generalized Steiner Problems and Other Variants," Journal of Combinatorial Optimization, Springer, vol. 4(4), pages 415-436, December.

    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:64:y:2000:i:1-3:p:165-176. 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.