Single-machine scheduling with deteriorating jobs and limited resource Online publication date: Mon, 17-Jul-2017
by Huafeng Dai; Wenming Cheng; Peng Guo
International Journal of Industrial and Systems Engineering (IJISE), Vol. 26, No. 4, 2017
Abstract: In this study, a single-machine scheduling problem with deteriorating jobs and limited resource was considered, whose objective is to minimise the makespan. The processing time of job is a linear function of the allotted resource and its starting time. The situation in which decision maker, with limited resource, has to satisfy the requirements from the customer is widespread, meanwhile, the makespan as an important objective in practical production deserves research. To solve the problem with particular significance, the heuristic named ratio comparison algorithm (RCA) and the RCA with pair-wise interchange (RCA-PI) were proposed. In addition, extensive computational experiments are conducted on the randomly generated instances to evaluate the performance of the proposed algorithms. Test results demonstrate that, compared with the lingo and neighbourhood search, the proposed RCA can provide good initial solutions for RCA-PI which are contribute to the obtain of high-quality schedules in a short period of time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook