LAUSR

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.