Single-machine scheduling problem with an availability constraint under simple linear deterioration 64002 3123 * (*: Lowcy@yuntech.edu.tw) View all notes 64002 3123 64002 3123

摘要

In this article, we study a single-machine scheduling problem with simple linear deteriorating jobs, the processing times of which are an increasing function of their starting times. The objective is to minimize the total completion time. The addressed problem is first formulated as a mixed integer programming model and solved optimally by LINGO v11.0. Next, we present some important lemmas for the basis of solving the problem. Finally, an algorithm using these lemmas is developed. Thirty replications are tested for the problem. They reveal that the proposed algorithm solves the problem efficiently and effectively in obtaining the optimal solution. View full textDownload full textKeywordssimple linear deterioration, total completion time, scheduling, availability constraintKeywords Related var addthis_config = { ui_cobrand: "Taylor & Francis Online", services_compact: "citeulike,netvibes,twitter,technorati,delicious,linkedin,facebook,stumbleupon,digg,google,more", pubid: "ra-4dff56cd6bb1830b" }; Add to shortlist Link Permalink http://dx.doi.org/10.1080/10170660903528754