IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v141y2013i1p66-78.html
   My bibliography  Save this article

A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems—A case study for solar cell industry

Author

Listed:
  • Chen, Yin-Yann
  • Cheng, Chen-Yang
  • Wang, Li-Chih
  • Chen, Tzu-Li

Abstract

This paper studies a solar cell industry scheduling problem which is similar to the traditional hybrid flow shop scheduling (HFS). In a typical HFS with parallel machines problem, the allocation of machine resources for each order should be scheduled in advance and then the optimal multiprocessor task scheduling in each stage could be determined. However, the challenge in solar cell manufacturing is the number of machines can be dynamically adjusted to complete the job within the shortest possible time. Therefore, the paper addresses a multi-stage HFS scheduling problem with characteristics of parallel processing, dedicated machines, sequence-independent setup time, and sequence-dependent setup time. The objective is to schedule the job production sequence, number of sublots, and dynamically allocate sublots to parallel machines such that the makespan time is minimized. The problem is formulated as a mixed integer linear programming (MILP) model. A hybrid approach based on the variable neighborhood search and particle swarm optimization (VNPSO) is developed to obtain the near-optimal solution. Preliminary computational study indicates that the developed VNPSO not only provides good quality solutions within a reasonable amount of time but also outperforms the classic branch and bound method and the current industry heuristic practiced by the case company.

Suggested Citation

  • Chen, Yin-Yann & Cheng, Chen-Yang & Wang, Li-Chih & Chen, Tzu-Li, 2013. "A hybrid approach based on the variable neighborhood search and particle swarm optimization for parallel machine scheduling problems—A case study for solar cell industry," International Journal of Production Economics, Elsevier, vol. 141(1), pages 66-78.
    • Handle: RePEc:eee:proeco:v:141:y:2013:i:1:p:66-78
    DOI: 10.1016/j.ijpe.2012.06.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527312002411
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2012.06.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. Valerie Botta-Genoulaz, 2000. "Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness," Post-Print hal-00398647, HAL.
    2. Anghinolfi, Davide & Paolucci, Massimo, 2009. "A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 193(1), pages 73-85, February.
    3. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    4. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    5. Botta-Genoulaz, Valerie, 2000. "Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 101-111, March.
    6. Vo[ss], Stefan & Witt, Andreas, 2007. "Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application," International Journal of Production Economics, Elsevier, vol. 105(2), pages 445-458, February.
    7. Janiak, Adam & Kozan, Erhan & Lichtenstein, Maciej & Oguz, Ceyda, 2007. "Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion," International Journal of Production Economics, Elsevier, vol. 105(2), pages 407-424, February.
    8. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    9. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    10. Jin, Zhihong & Yang, Zan & Ito, Takahiro, 2006. "Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 100(2), pages 322-334, April.
    11. Coelho, Leandro dos Santos & Mariani, Viviana Cocco, 2009. "A novel chaotic particle swarm optimization approach using Hénon map and implicit filtering local search for economic load dispatch," Chaos, Solitons & Fractals, Elsevier, vol. 39(2), pages 510-518.
    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. Absalom E Ezugwu & Olawale J Adeleke & Serestina Viriri, 2018. "Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times," PLOS ONE, Public Library of Science, vol. 13(7), pages 1-23, July.
    3. Sadeghi, Parisa & Rebelo, Rui Diogo & Ferreira, José Soeiro, 2021. "Using variable neighbourhood descent and genetic algorithms for sequencing mixed-model assembly systems in the footwear industry," Operations Research Perspectives, Elsevier, vol. 8(C).
    4. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
    5. Marco Schulze & Julia Rieck & Cinna Seifi & Jürgen Zimmermann, 2016. "Machine scheduling in underground mining: an application in the potash industry," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 365-403, March.
    6. Yu, Yang & Tang, Jiafu & Sun, Wei & Yin, Yong & Kaku, Ikou, 2013. "Reducing worker(s) by converting assembly line into a pure cell system," International Journal of Production Economics, Elsevier, vol. 145(2), pages 799-806.

    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. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    2. Amin-Naseri, Mohammad Reza & Beheshti-Nia, Mohammad Ali, 2009. "Hybrid flow shop scheduling with parallel batching," International Journal of Production Economics, Elsevier, vol. 117(1), pages 185-196, January.
    3. Chou, Fuh-Der, 2013. "Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks," International Journal of Production Economics, Elsevier, vol. 141(1), pages 137-145.
    4. Marco Schulze & Julia Rieck & Cinna Seifi & Jürgen Zimmermann, 2016. "Machine scheduling in underground mining: an application in the potash industry," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 365-403, March.
    5. Carlos Paternina-Arboleda & Jairo Montoya-Torres & Milton Acero-Dominguez & Maria Herrera-Hernandez, 2008. "Scheduling jobs on a k-stage flexible flow-shop," Annals of Operations Research, Springer, vol. 164(1), pages 29-40, November.
    6. Missaoui, Ahmed & Ruiz, Rubén, 2022. "A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows," European Journal of Operational Research, Elsevier, vol. 303(1), pages 99-113.
    7. 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.
    8. Albert Corominas & Alberto García-Villoria & Rafael Pastor, 2013. "Metaheuristic algorithms hybridised with variable neighbourhood search for solving the response time variability problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 296-312, July.
    9. 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.
    10. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    11. Yang, Taho & Kuo, Yiyo & Cho, Chiwoon, 2007. "A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1859-1873, February.
    12. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    13. Pan, Quan-Ke & Wang, Ling & Li, Jun-Qing & Duan, Jun-Hua, 2014. "A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation," Omega, Elsevier, vol. 45(C), pages 42-56.
    14. Madiha Harrabi & Olfa Belkahla Driss & Khaled Ghedira, 2021. "A hybrid evolutionary approach to job-shop scheduling with generic time lags," Journal of Scheduling, Springer, vol. 24(3), pages 329-346, June.
    15. Hejer Khlif Hachicha & Farah Zeghal Mansour, 2018. "Two-MILP models for scheduling elective surgeries within a private healthcare facility," Health Care Management Science, Springer, vol. 21(3), pages 376-392, September.
    16. Kuo, Yiyo & Yang, Taho & Cho, Chiwoon & Tseng, Yao-Ching, 2008. "Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 78(1), pages 40-56.
    17. Khalil Tliba & Thierno M. L. Diallo & Olivia Penas & Romdhane Ben Khalifa & Noureddine Ben Yahia & Jean-Yves Choley, 2023. "Digital twin-driven dynamic scheduling of a hybrid flow shop," Journal of Intelligent Manufacturing, Springer, vol. 34(5), pages 2281-2306, June.
    18. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    19. Pang, King-Wah, 2013. "A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness," International Journal of Production Economics, Elsevier, vol. 141(1), pages 127-136.
    20. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.

    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:141:y:2013:i:1:p:66-78. 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.