Abstract
This study addresses the scheduling problem where every job requires several types of resources. At every point in time, the capacity of resources is limited. When necessary, the capacity can be increased at a cost. Each job has a due date, and the processing times of jobs are random variables with a known probability distribution. The considered problem is to determine a schedule that minimises the total cost, which consists of the cost incurred due to the violation of resource limits and the total tardiness of jobs. A genetic algorithm enhanced by local search is proposed. The sample average approximation method is used to construct a confidence interval for the optimality gap of the obtained solutions. Computational study on the application of the sample average approximation method and genetic algorithm is presented. It is revealed that the proposed method is capable of providing high-quality solutions to large instances in a reasonable time. • We study the problem of scheduling jobs sharing multiple resources under uncertainty. • Genetic algorithm enhanced by local search is developed. • Polynomial-time algorithm for evaluating the objective function is proposed. • Improved confidence interval for the optimality gap of obtained solutions is constructed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
