Production scheduling with genetic algorithms subject to mmintenance constraint
2008
0 views
0 downloads
Advisor: Yrd. Doç. Dr. Baha Güney
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
Dr. 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
- Computational investigation of battery materials using density functional theory(2023)
- Haci Ahmed b. Seyyid al-Bigavî and Tarjama al-Awārif al-maārif (sections of 22-43)(2024)
- Synthesis of carbazol substituted 3,4-dihydropyrimidine-2(1h)-thione deri̇vati̇ves(2024)
- Classification of recyclable wastes with deep learning models: A comparison on the effect of dataset size(2024)
- Hermeneutical analysis of sacrifice, sacred violence and scapegoat motifs in Turkish Mythology(2024)
- Novel thio-chalcone substituted metallophthalocyanines: synthesis, characterization and redox behaviour(2018)