The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Mathematical Modeling and Genetic Algorithms for Product Sequencing in a Cellular System
Abstract
This chapter considers a product-sequencing problem in a synchronized manufacturing environment, which is using a uniform time bucket approach for synchronization. This problem has been observed in a jewelry manufacturing company and is valid in other labor-intensive cellular environments. The scheduling problem handled has two aspects: first, determining manpower allocation; second, sequencing the products in order to minimize the number of periods where available manpower is exceeded. The number of operators needed in a time bucket may exceed the available manpower level as different products have different manpower requirements for different processes. A mathematical model is developed for the manpower allocation part of the problem. To perform product sequencing, two methods are used, namely mathematical modeling and genetic algorithm. A new five-phase GA approach is proposed, and the results show that it outperforms the classical GA. Several experiments have been conducted to find better GA parameters as well. Finally, GA results are compared with mathematical model results. Mathematical Modeling finds optimal result in a reasonable time for small problems. On the other hand, for the bigger problems, genetic algorithm is a feasible approach to use.
Related Content
|
Göran Roos.
© 2026.
28 pages.
|
|
Uzma Abbas, Shalom Akhai, Mahapara Abbass, Sana Abass, Arti Chouksey, Amandeep Singh Wadhwa.
© 2026.
54 pages.
|
|
Rismawati Rismawati, Suaedi Suaedi, Supriadi Supriadi, St. Salmah Sharon, Abdul Haris.
© 2026.
36 pages.
|
|
Dinar Kale, Pallavi Joshi, Stuart Parris.
© 2026.
36 pages.
|
|
Prodromos I. Prodromidis.
© 2026.
38 pages.
|
|
Lefteris Topaloglou, Despoina Kanteler, Yiannis Karagiannis, Dionysios Giannakopoulos, Dimitris Kallioras.
© 2026.
38 pages.
|
|
Jipson Joseph, Achyutananda Mishra.
© 2026.
32 pages.
|
|
|