IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v41y2013i2p226-235.html
   My bibliography  Save this article

Reducing the number of setups for CNC punch presses

Author

Listed:
  • Marvizadeh, S. Zamiri
  • Choobineh, F.F.

Abstract

Large computer numerical control (CNC) punch presses are widely used for punching holes in heavy gage sheet metals. The turret of such presses has limited tool capacity, and any tool changes require dismantling the turret. Dismantling and reloading the turret generally takes several hours and is the dominant element of the total flow time for a batch of sheet metals. Reducing the turret setup time requires judicious grouping of the required tool set. We formulated an integer program to obtain the minimum number of setups. However, since the problem is nondeterministic polynomial-time hard (NP-hard), we offer three heuristics to solve the problem. We compare solutions obtained from the three heuristics with their respective optimal solutions using three simulated data sets and an industrial data set.

Suggested Citation

  • Marvizadeh, S. Zamiri & Choobineh, F.F., 2013. "Reducing the number of setups for CNC punch presses," Omega, Elsevier, vol. 41(2), pages 226-235.
    • Handle: RePEc:eee:jomega:v:41:y:2013:i:2:p:226-235
    DOI: 10.1016/j.omega.2012.06.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048312000965
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2012.06.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Meltem Denizel, 2003. "Minimization of the Number of Tool Magazine Setups on Automated Machines: A Lagrangean Decomposition Approach," Operations Research, INFORMS, vol. 51(2), pages 309-320, April.
    2. Christopher S. Tang & Eric V. Denardo, 1988. "Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants," Operations Research, INFORMS, vol. 36(5), pages 778-784, October.
    3. Konak, Abdullah & Kulturel-Konak, Sadan & Azizoglu, Meral, 2008. "Minimizing the number of tool switching instants in Flexible Manufacturing Systems," International Journal of Production Economics, Elsevier, vol. 116(2), pages 298-307, December.
    4. Tang, Lixin & Wang, Gongshu, 2008. "Decision support system for the batching problems of steelmaking and continuous-casting production," Omega, Elsevier, vol. 36(6), pages 976-991, December.
    5. Gribkovskaia, Irina V. & Kovalev, Sergey & Werner, Frank, 2010. "Batching for work and rework processes on dedicated facilities to minimize the makespan," Omega, Elsevier, vol. 38(6), pages 522-527, December.
    6. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    7. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, 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. Malaguti, Enrico & Medina Durán, Rosa & Toth, Paolo, 2014. "Approaches to real world two-dimensional cutting problems," Omega, Elsevier, vol. 47(C), pages 99-115.

    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. 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.
    2. Konak, Abdullah & Kulturel-Konak, Sadan & Azizoglu, Meral, 2008. "Minimizing the number of tool switching instants in Flexible Manufacturing Systems," International Journal of Production Economics, Elsevier, vol. 116(2), pages 298-307, December.
    3. Slotnick, Susan A., 2011. "Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size," European Journal of Operational Research, Elsevier, vol. 210(3), pages 527-536, May.
    4. Schwerdfeger, Stefan & Boysen, Nils, 2017. "Order picking along a crane-supplied pick face: The SKU switching problem," European Journal of Operational Research, Elsevier, vol. 260(2), pages 534-545.
    5. Cheng, Bayi & Zhu, Huijun & Li, Kai & Li, Yongjun, 2019. "Optimization of batch operations with a truncated batch-position-based learning effect," Omega, Elsevier, vol. 85(C), pages 134-143.
    6. Mehravaran, Yasaman & Logendran, Rasaratnam, 2012. "Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 135(2), pages 953-963.
    7. 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.
    8. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.
    9. 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.
    10. 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.
    11. 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.
    12. Murat Güngör, 2016. "A note on efficient sequences with respect to total flow time and number of tardy jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(4), pages 346-348, June.
    13. 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.
    14. Holsapple, Clyde W. & Lee-Post, Anita, 2010. "Behavior-based analysis of knowledge dissemination channels in operations management," Omega, Elsevier, vol. 38(3-4), pages 167-178, June.
    15. 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.
    16. Mujawar, Sachin & Huang, Simin & Nagi, Rakesh, 2012. "Scheduling to minimize stringer utilization for continuous annealing operations," Omega, Elsevier, vol. 40(4), pages 437-444.
    17. 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.
    18. 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.
    19. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    20. Juan Villegas & Fernando Palacios & Andrés Medaglia, 2006. "Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example," Annals of Operations Research, Springer, vol. 147(1), pages 109-141, October.

    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:jomega:v:41:y:2013:i:2:p:226-235. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.