کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4631183 | 1340617 | 2011 | 8 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration](/preview/png/4631183.png)
In this paper, we address a two-machine flow shop scheduling problem under simple linear deterioration. By a simple linear deterioration function, we mean that the processing time of a job is a simple linear function of its execution start time. The objective is to find a sequence that minimizes total weighted completion time. Optimal schedules are obtained for some special cases. For the general case, several dominance properties and two lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. A heuristic algorithm is also proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational analysis on randomly generated problems is conducted to evaluate the branch-and-bound algorithm and heuristic algorithm.
Journal: Applied Mathematics and Computation - Volume 217, Issue 9, 1 January 2011, Pages 4819–4826