IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v270y2018i1d10.1007_s10479-016-2304-3.html
   My bibliography  Save this article

A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing

Author

Listed:
  • Yashar Ahmadov

    (University of Vaasa)

  • Petri Helo

    (University of Vaasa)

Abstract

This paper presents a prototype system of sheet metal processing machinery which collects production order data, passes current information to cloud based centralized job scheduling for setup time reduction and updates the production calendar accordingly. A centralized cloud service can collect and analyse production order data for machines and suggest optimized schedules. This paper explores the application of sequencing algorithms in the sheet metal forming industry, which faces sequence-dependent changeover times on single machine systems. We analyse the effectiveness of using such algorithms in the reduction of total setup times. We describe alternative models: Clustering, Nearest Neighbourhood and Travelling Salesman Problem, and then apply them to real data obtained from a manufacturing company, as well as to randomly generated data sets. Based on the prototype implementation clustering algorithm was proposed for actual implementation. Sequence-dependency increases the complexity of the scheduling problems; thus, effective approaches are required to solve them. The algorithms proposed in this paper provide efficient solutions to these types of sequencing problems.

Suggested Citation

  • Yashar Ahmadov & Petri Helo, 2018. "A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing," Annals of Operations Research, Springer, vol. 270(1), pages 5-24, November.
    • Handle: RePEc:spr:annopr:v:270:y:2018:i:1:d:10.1007_s10479-016-2304-3
    DOI: 10.1007/s10479-016-2304-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2304-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-016-2304-3?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. A. G. Lockett & A. P. Muhlemann, 1972. "Technical Note—A Scheduling Problem Involving Sequence Dependent Changeover Times," Operations Research, INFORMS, vol. 20(4), pages 895-902, August.
    2. Waiman Cheung & Hong Zhou, 2001. "Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times," Annals of Operations Research, Springer, vol. 107(1), pages 65-81, October.
    3. Radosław Rudek, 2012. "Scheduling problems with position dependent job processing times: computational complexity results," Annals of Operations Research, Springer, vol. 196(1), pages 491-516, July.
    4. Anne M. Spence & Evan L. Porteus, 1987. "Setup Reduction and Increased Effective Capacity," Management Science, INFORMS, vol. 33(10), pages 1291-1301, October.
    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. Piera Centobelli & Roberto Cerchione & Davide Chiaroni & Pasquale Del Vecchio & Andrea Urbinati, 2020. "Designing business models in circular economy: A systematic literature review and research agenda," Business Strategy and the Environment, Wiley Blackwell, vol. 29(4), pages 1734-1749, 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. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    2. Jacomine Grobler & Andries Engelbrecht & Schalk Kok & Sarma Yadavalli, 2010. "Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time," Annals of Operations Research, Springer, vol. 180(1), pages 165-196, November.
    3. White, Richard E. & Prybutok, Victor, 2001. "The relationship between JIT practices and type of production system," Omega, Elsevier, vol. 29(2), pages 113-124, April.
    4. Sarker, Bhaba R. & Coates, Eyler Robert, 1997. "Manufacturing setup cost reduction under variable lead times and finite opportunities for investment," International Journal of Production Economics, Elsevier, vol. 49(3), pages 237-247, May.
    5. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Research on permutation flow shop scheduling problems with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 211(1), pages 473-480, December.
    6. Peng Liu & Xiaoli Wang, 2017. "Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date," Journal of Optimization, Hindawi, vol. 2017, pages 1-7, April.
    7. Sherali, Hanif D. & Van Goubergen, Dirk & Van Landeghem, Hendrik, 2008. "A quantitative approach for scheduling activities to reduce set-up in multiple machine lines," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1224-1237, June.
    8. Zhou, Hong & Cheung, Waiman & Leung, Lawrence C., 2009. "Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm," European Journal of Operational Research, Elsevier, vol. 194(3), pages 637-649, May.
    9. Baruch Mor & Gur Mosheiov, 2018. "A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection," Annals of Operations Research, Springer, vol. 271(2), pages 1079-1085, December.
    10. Pereira, Javier & Paulre, Bernard, 2001. "Flexibility in manufacturing systems: A relational and a dynamic approach," European Journal of Operational Research, Elsevier, vol. 130(1), pages 70-82, April.
    11. Guillermo Gallego & Ilkyeong Moon, 1995. "Strategic investment to reduce setup times in the economic lot scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 773-790, August.
    12. Gong, Qiguo & Chen, Guohui & Zhang, Wen & Wang, Hui, 2022. "The role of humans in flexible smart factories," International Journal of Production Economics, Elsevier, vol. 254(C).
    13. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
    14. Giri, B. C. & Moon, I., 2004. "Note on an economic lot scheduling problem under budgetary and capacity constraints," International Journal of Production Economics, Elsevier, vol. 91(3), pages 229-234, October.
    15. Banerjee, Avijit & Pyreddy, Vijay R. & Kim, Seung Lae, 1996. "Investment policy for multiple product setup reduction under budgetary and capacity constraints," International Journal of Production Economics, Elsevier, vol. 45(1-3), pages 321-327, August.
    16. Diaby, Moustapha & Cruz, Jose M. & Nsakanda, Aaron L., 2013. "Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction," European Journal of Operational Research, Elsevier, vol. 228(3), pages 526-535.
    17. Matsuyama, Keisuke, 1995. "Inventory policy with time-dependent setup cost," International Journal of Production Economics, Elsevier, vol. 42(2), pages 149-160, December.
    18. Gupta, Diwakar & Gerchak, Yigal, 1995. "Joint product durability and lot sizing models," European Journal of Operational Research, Elsevier, vol. 84(2), pages 371-384, July.
    19. Markó Horváth & Tamás Kis, 2020. "Polyhedral results for position-based scheduling of chains on a single machine," Annals of Operations Research, Springer, vol. 284(1), pages 283-322, January.
    20. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.

    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:spr:annopr:v:270:y:2018:i:1:d:10.1007_s10479-016-2304-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.