Abstract
We consider three single-machine scheduling problems in which the processing time of each job is inversely proportional to the power of k of the resource consumption amount. Given a set of jobs and the resource lower and upper bounds for each job, the problem is to determine the job sequence and the number of resources allocated to each job. We consider three different objectives. The first (and the third) objective is to minimize the sum of the makespan (and total completion time, respectively) and the total resource consumption cost. The second is to minimize the makespan subject to the total resource consumption amount. We show that the three problems are polynomially solvable.
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 callMore From: Journal of the Korean Operations Research and Management Science Society
Disclaimer: 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.
