Abstract
We consider a scheduling problem in which the processors are arranged along a straight line, and each job requires simultaneous processing by multiple consecutive processors. We assume that the job sizes and processing times are agreeable. Our objective is to minimize the total weighted completion time of the jobs. This problem is motivated by the operation of berth allocation, which is to allocate vessels (jobs) to a berth with multiple quay cranes (processors), where a vessel may be processed by multiple consecutive cranes simultaneously. We develop a heuristic for the problem and perform worst-case analysis.
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.
