We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Sıra Bağımlı Hazırlık Süreli Özdeş Olmayan Paralel Makine Çizelgeleme Problemi: Oluklu Mukavva Fabrikasında Bir Uygulama.
- Authors
Ünlü, Sümeyye; Alakaş, Hacı Mehmet
- Abstract
The problem of non-identical parallel machine scheduling has been one of the issues that attracted the attention of enterprises recently. Being able to do a job very effectively and quickly depends on scheduling. Any extra time spent, such as the processing times of the machines, the preparation times for product transitions, affects the production speed and capacity. In this study, nonidentical parallel machine scheduling problem with sequence dependent setup time is discussed. The study was carried out practically in a company that produces corrugated cardboard. The aim of the study is to minimization of maximum completion time (Cmax). There are two parallel machines in the company that are used in the same operations but are not identical according to their features. Machine differences are speed, capacity, preparation times for product transitions and technical features. 112 order-product information and information about the preparation times made on the machines were obtained from the enterprise. In line with the information received, the processing times of the incoming orders and the preparation times of the preparations made during the product transitions were calculated. These calculated data were transferred to the created mathematical model and solved with the ILOG Cplex Optimization program. As a result of the solution, a two-week production schedule suitable for the enterprise was obtained.
- Publication
International Journal of Engineering Research & Development (IJERAD), 2022, Vol 14, Issue 2, p552
- ISSN
1308-5514
- Publication type
Article
- DOI
10.29137/umagd.1059071