Title of article
SINGLE MACHINE SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND DETERIORATING JOBS
Author/Authors
Hamta, N. amirkabir university of technology - Department of Industrial Engineering, تهران, ايران , Fatemi Ghomi, S. M. T. amirkabir university of technology - Department of Industrial Engineering, تهران, ايران , Bahalke, U. iran university of science and technology - Department of Industrial Engineering, تهران, ايران , Golpaigani, H.R. iran university of science and technology - Department of Industrial Engineering, تهران, ايران
From page
115
To page
122
Abstract
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs and a mathematical model based on binary integer programming (BIP) is developed. Since the precedence constraints exist, a job cannot start before completion of its all predecessors. The proposed model consists of two steps: in the first step, the earliest starting time of each job is computed; then the results are used in the second step in which an optimal sequence between jobs is determined with the aim of minimizing the total completion time. Finally, a numerical example is presented and solved using optimization software LINGO 8.0.
Keywords
Single Machine , Scheduling , Precedence Constraints , Job Deterioration , Mathematical Modeling
Journal title
International Journal of Engineering
Journal title
International Journal of Engineering
Record number
2563692
Link To Document