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

Carryover sequence-dependent group scheduling with the integration of internal and external setup times

Author

Listed:
  • Yazdani Sabouni, M.T.
  • Logendran, Rasaratnam

Abstract

This paper addresses a group scheduling problem in a two-machine flow shop with a bicriteria objective and carryover sequence-dependent setup times. This special type of group scheduling problem typically arises in the assembly of printed circuit boards (PCBs). The objective is to sequence all board types in a board group as well as board groups themselves in a way that the objective function is minimized. We introduce the carryover sequence-dependent setup on machines, and call it internal setup. As an opportunity for manufacturers to decrease the costs, the focus is to completely eliminate the role of the kitting staff. Thus, we introduce the external setup (kitting) time for the next board group and require it to be performed by the machine operator during the time he is idle. Consequently, the internal and external setup times are integrated in this research, and to the best of our knowledge it is for the first time a research on PCB group scheduling is performed by integrating both setups. In order to solve this problem, first a mathematical model is developed. Then a heuristic together with two other meta-heuristic algorithms (one based on tabu search and the other based on genetic algorithm) are proposed and their efficiency and effectiveness on several problems are tested. Also a statistical experimental design is performed in order to evaluate the impact of different factors on the performance of the algorithms.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:224:y:2013:i:1:p:8-22
    DOI: 10.1016/j.ejor.2012.07.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712005358
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.07.013?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. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    2. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. 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.
    5. Choi, Seong-Woo & Kim, Yeong-Dae, 2009. "Minimizing total tardiness on a two-machine re-entrant flowshop," European Journal of Operational Research, Elsevier, vol. 199(2), pages 375-384, December.
    6. Ashayeri, J. & Selen, W., 2007. "A planning and scheduling model for onsertion in printed circuit board assembly," European Journal of Operational Research, Elsevier, vol. 183(2), pages 909-925, December.
    7. 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.
    8. Schaller, Jeffrey E. & Gupta, Jatinder N. D. & Vakharia, Asoo J., 2000. "Scheduling a flowline manufacturing cell with sequence dependent family setup times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 324-339, September.
    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. S Afshin Mansouri & Emel Aktas, 2016. "Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1382-1394, November.
    3. Mansouri, S. Afshin & Aktas, Emel & Besikci, Umut, 2016. "Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption," European Journal of Operational Research, Elsevier, vol. 248(3), pages 772-788.

    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. 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.
    2. 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.
    3. 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.
    4. Logendran, Rasaratnam & deSzoeke, Paula & Barnard, Faith, 2006. "Sequence-dependent group scheduling problems in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 102(1), pages 66-86, July.
    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. Choudhury, Nilanjan D. & Wilhelm, Wilbert E. & Rao, Brijesh & Gott, Jonathan & Khotekar, Nikhilesh, 2007. "Process planning for circuit card assembly on a series of dual head placement machines," European Journal of Operational Research, Elsevier, vol. 182(2), pages 626-639, October.
    7. 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.
    8. Beezão, Andreza Cristina & Cordeau, Jean-François & Laporte, Gilbert & Yanasse, Horacio Hideki, 2017. "Scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 257(3), pages 834-844.
    9. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    10. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    11. repec:hal:journl:hal-04689665 is not listed on IDEAS
    12. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    13. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    14. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    15. David Fischer & Péter Györgyi, 2023. "Approximation algorithms for coupled task scheduling minimizing the sum of completion times," Annals of Operations Research, Springer, vol. 328(2), pages 1387-1408, September.
    16. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    17. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    18. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    19. Ji, P. & Sze, M. T. & Lee, W. B., 2001. "A genetic algorithm of determining cycle time for printed circuit board assembly lines," European Journal of Operational Research, Elsevier, vol. 128(1), pages 175-184, January.
    20. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
    21. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.

    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:224:y:2013:i:1:p:8-22. 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.