Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
Publish Year: 1390
نوع سند: مقاله ژورنالی
زبان: English
View: 136
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJE-24-8_002
تاریخ نمایه سازی: 17 بهمن 1400
Abstract:
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the results are used in second step of the model, which determine a sequence between jobs by the aim of minimizing the total completion time. At the end a numerical example is presented and solved by the Lingo ۸.۰ mathematical software.
Keywords:
Authors
Hamid Reza Golpaigani
Industrial Engineering, Iran University of Science and Technology
Nima Hamta
Industrial Engineering, Arak University of Technology
Unes Unes
Industrial Engineering, Iran University of Science and Technology