Simultaneous Scheduling of Assembly and Production Shops Using GA based Heuristic
DOI:
https://doi.org/10.61841/tfx65e56Keywords:
Scheduling, Meta- heuristic, Genetic Algorithm.Abstract
This paper addresses a scheduling problem in an industry that manufactures machines. The manufacturing facility of the industry consist of two sections namely production shops and assembly shops. Production encompasses four subsections in it. Production shop is commonly shared by the components of different machines. But the assembly shops have independent section for each machine. Due to the sharing of production shops the components are not delivered in time to the assembly shop which delays the assembly of a product. The above problem is addressed by simultaneously scheduling the production and assembly shops with an objective criterion of minimum penalty cost. The production environment is of job shop in nature. The schedule generated accounts the alternative routing as it increases the flexibility in scheduling. Job shop problem are combinatorial optimization problems, account of alternative routing increase the complexity of the problem. The above problem becomes NP hard in nature. Meta heuristics are evolving as a promising alternative to address the NP hard problems. Genetic algorithm one among the Meta heuristic is used to evolve the simultaneous schedule of production and assembly shops and it is illustrated with the different products models developed to represent the machines of the company.
Downloads
References
[1] Jawahar. N, Aravindhan. P, and Ponnambalam. S.G., 1998, “A Genetic Algorithm for scheduling Flexible Manufacturing Systems”, The international Journal of advanced Manufacturing Technology, vol 14,pp. 588 – 607.
[2] Wilhelm. W and shin, H., 1985,”Effectiveness of alternative operations in a flexible manufacturing Systems”, International journal of production research, vol.23,pp 65-79.
[3] Hankins. S.L., Wysks. R.A and fox. K.R., 1984, “Using a CATS database for alternative machine loading,
Journal of manufacturing Systems, vol.3.pp 115-120.
[4] Moon.J and Lee. J., 2000, “Genetic Algorithm Application to the Job Shop Scheduling problem with Alternative Routing”, Brain Korea 21 Logistics team, pusan national university.
[5] Hitomi.K, “Manufacturing system engineering”, Viva books private limited, chennai, 1998.
[6] Thiagarajan.s and rajendran.c, “Scheduling in dynamic assembly job-shop with having different holding and tardiness costs”, International journal of production research, vol41, no.18, 2003, pp. 4453-4486.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
