Abstract
ABSTRACTIn this note, single machine scheduling with concurrent resource allocation and position-dependent workloads is studied. The aim is to find jointly the optimal sequence and the optimal resource allocation. A bicriteria analysis of the problem is provided where the first criterion is to minimize the scheduling cost (i.e. makespan, total completion time, total absolute differences in completion times, total absolute differences in waiting times) and the second criterion is to minimize the total resource consumption cost. It is proved that four bicriteria problems can be solved efficiently.
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.
