A two-stage solution approach for plastic injection machines scheduling problem

Tugba Sarac, ,Eskisehir Osmangazi University, Department of Industrial Engineering, Meselik Campus, 26040, Eskisehir, Turkey, Aydin Sipahioglu, Emine Akyol Ozer, ,Eskisehir Technical University, Department of Industrial Engineering, Iki Eylul Campus, 26555, Eskisehir, Turkey
<span title="">2017</span> <i title="American Institute of Mathematical Sciences (AIMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s5irg25l6bbd7hbii2cthj7k3m" style="color: black;">Journal of Industrial and Management Optimization</a> </i> &nbsp;
One of the most common plastic manufacturing methods is injection molding. In injection molding process, scheduling of plastic injection machines is very difficult because of the complex nature of the problem. For example, similar plastic parts should be produced sequentially to prevent long setup times. On the other hand, to produce a plastic part, its mold should be fixed on an injection machine. Machine eligibility restrictions should be considered because a mold can be usually fixed on a
more &raquo; ... set of the injection machines. Some plastic parts which have same shapes but different colors are used same mold so these parts can only be scheduled simultaneously if their mold has copies, otherwise resource constraints should be considered. In this study, a multi-objective mathematical model is proposed for parallel machine scheduling problem to minimize makespan, total tardiness, and total waiting time. Since NP-hard nature of problem, this paper presents a two-stage mathematical model and a two-stage solution approach. In the first stage of mathematical model, jobs are assigned to the machines and each machine is scheduled separately in the second stage. The integrated model and two-stage mathematical model are scalarized by using goal programming, compromise programming and Lexicographic Weighted Tchebycheff programming methods. To solve large-scale problems in a short time, a two-stage solution approach is also proposed. In the first stage of this approach, jobs are assigned to machines and scheduled by using proposed simulated annealing algorithm. In the second stage of the approach, starting time, completion time and waiting time of the jobs are calculated by using a mathematical model. The performance of the methods is demonstrated on randomly generated test problems. 2010 Mathematics Subject Classification. Primary: 90C29 , 90C90; Secondary: 90B35.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3934/jimo.2020022">doi:10.3934/jimo.2020022</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a3faqiacgnd7lc4sbmht3c3qiy">fatcat:a3faqiacgnd7lc4sbmht3c3qiy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200505164705/https://www.aimsciences.org/article/exportPdf?id=d2efe482-3c57-4ecd-bf8f-aafb5ef6e7b2" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ef/a0/efa0a425ed06b11eef94440f2492cb272747a568.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3934/jimo.2020022"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>