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

Metaheuristics for drilling operation scheduling in Taiwan PCB industries

Author

Listed:
  • Liang, Yun-Chia
  • Hsiao, Yu-Ming
  • Tien, Chia-Yun

Abstract

Among all types of production environment, identical parallel machines are frequently used to increase the manufacturing capacity of the drilling operation in Taiwan printed circuit board (PCB) industries. Additionally, multiple but conflicting objectives are usually considered when a manager plans the production scheduling. Compared to the single objective problem, the multiple-objective version no longer looks for an individual optimal solution, but a Pareto front consisting of a set of non-dominated solutions will be needed and established. The manager then can select one of the alternatives from the set. This research aims at employing a variable neighborhood search (VNS) algorithm and a multiple ant colony optimization (MACO) algorithm to solve the identical parallel-machine scheduling problem with two conflicting objectives: makespan and total tardiness. In VNS, two neighborhoods are defined—insert a job to a different position or swap two jobs in the sequence. To save the computational expense, one of the neighborhoods is randomly selected for the target solution which is also arbitrarily chosen from the current Pareto front. In MACO, a two-phase construction procedure where three colonies are employed in each phase is proposed. These two algorithms are tested on a set of real data collected from a leading PCB factory in Taiwan and their performances are compared. The computational results show that VNS outperforms all competing algorithms—SPGA, MOGA, NSGA-II, SPEA-II, and MACO in terms of solution quality and computational time.

Suggested Citation

  • Liang, Yun-Chia & Hsiao, Yu-Ming & Tien, Chia-Yun, 2013. "Metaheuristics for drilling operation scheduling in Taiwan PCB industries," International Journal of Production Economics, Elsevier, vol. 141(1), pages 189-198.
  • Handle: RePEc:eee:proeco:v:141:y:2013:i:1:p:189-198
    DOI: 10.1016/j.ijpe.2012.04.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527312001727
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2012.04.014?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. Liang, Yun-Chia & Chen, Yi-Ching, 2007. "Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm," Reliability Engineering and System Safety, Elsevier, vol. 92(3), pages 323-331.
    2. Li, Kunpeng & Sivakumar, Appa Iyer & Ganesan, Viswanath Kumar, 2008. "Analysis and algorithms for coordinated scheduling of parallel machine manufacturing and 3PL transportation," International Journal of Production Economics, Elsevier, vol. 115(2), pages 482-491, October.
    3. Huang, Rong-Hwa & Yang, Chang-Lin, 2008. "Overlapping production scheduling planning with multiple objectives--An ant colony approach," International Journal of Production Economics, Elsevier, vol. 115(1), pages 163-170, September.
    4. Garcia-Martinez, C. & Cordon, O. & Herrera, F., 2007. "A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP," European Journal of Operational Research, Elsevier, vol. 180(1), pages 116-148, July.
    5. C Gagné & M Gravel & W L Price, 2005. "Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 687-698, June.
    6. T'kindt, Vincent & Monmarche, Nicolas & Tercinet, Fabrice & Laugt, Daniel, 2002. "An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 250-257, 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. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.

    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. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    2. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    3. Wu, Jinchao & Chen, Bokui & Zhang, Kai & Zhou, Jun & Miao, Lixin, 2018. "Ant pheromone route guidance strategy in intelligent transportation systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 591-603.
    4. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    5. Ardakan, Mostafa Abouei & Talkhabi, Sajjad & Juybari, Mohammad N., 2022. "Optimal activation order vs. redundancy strategies in reliability optimization problems," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    6. Jiae Zhang & Jianjun Yang, 2016. "Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4894-4918, August.
    7. Wen, Charlie & Eksioglu, Sandra Duni & Greenwood, Allen & Zhang, Shu, 2010. "Crane scheduling in a shipbuilding environment," International Journal of Production Economics, Elsevier, vol. 124(1), pages 40-50, March.
    8. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    9. Boxuan Zhao & Jianmin Gao & Kun Chen & Ke Guo, 2018. "Two-generation Pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines," Journal of Intelligent Manufacturing, Springer, vol. 29(1), pages 93-108, January.
    10. Debasis Bhattacharya & Soma Roychowdhury, 2017. "A redundancy strategy for minimizing cost in systems with non-disjoint subsystems under reliability constraint," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 645-655, November.
    11. Abdossaber Peiravi & Mahdi Karbasian & Mostafa Abouei Ardakan, 2018. "K-mixed strategy: A new redundancy strategy for reliability problems," Journal of Risk and Reliability, , vol. 232(1), pages 38-51, February.
    12. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    13. Peiravi, Abdossaber & Nourelfath, Mustapha & Zanjani, Masoumeh Kazemi, 2022. "Universal redundancy strategy for system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    14. Gholinezhad, Hadi & Zeinal Hamadani, Ali, 2017. "A new model for the redundancy allocation problem with component mixing and mixed redundancy strategy," Reliability Engineering and System Safety, Elsevier, vol. 164(C), pages 66-73.
    15. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    16. Seyed Mohsen Mousavi & Najmeh Alikar & Madjid Tavana & Debora Di Caprio, 2019. "An improved particle swarm optimization model for solving homogeneous discounted series-parallel redundancy allocation problems," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1175-1194, March.
    17. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    18. Jiahui Qian & Zhijing Zhang & Lingling Shi & Dan Song, 2023. "An assembly timing planning method based on knowledge and mixed integer linear programming," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 429-453, February.
    19. Zhang, Enze & Chen, Qingwei, 2016. "Multi-objective reliability redundancy allocation in an interval environment using particle swarm optimization," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 83-92.
    20. Abouei Ardakan, Mostafa & Zeinal Hamadani, Ali, 2014. "Reliability optimization of series–parallel systems with mixed redundancy strategy in subsystems," Reliability Engineering and System Safety, Elsevier, vol. 130(C), pages 132-139.

    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:189-198. 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.