Production scheduling with genetic algorithms subject to mmintenance constraint
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
Generally job-shop scheduling problem focuses on minimize the total completion time all jobs. Maintenance is not considered. However every machine requires maintenance and this must be planned on production schedule. The objective of this thesis is minimizing jobs completion time and also schedule the machines preventive maintenance with genetic algorithms. An application is demonstrated for a case study in electro-mechanic industry for press shop weekly scheduling under strict maintenance plan.
Author
Ahmet Erdem
Institution
How to Cite
Ahmet Erdem (Master Thesis). Production scheduling with genetic algorithms subject to mmintenance constraint, 2008, Sakarya University, Endüstri Mühendisliği Bölümü.
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Sakarya University
- Turkey according to the records of the House of Commons (1918-1922)(2011)
- Ömer Öngüt, his views and community through publications(2025)
- Mawlana Yaqub-i Charkhi And His tafsir(2024)
- Research of teachers' attitudes and self-efficacy perceptions towards distance education application(2024)
- Tiles in architect Vedat Tek's Istanbul buildings(2024)
- Financial performance evaluation and the relationship between stock returns: Hesitant Fuzzy AHP based approach(2020)