Abstract
AbstractIn this paper, we studied a multi hoists scheduling problem with transportation constraints. For each job, there are several operations which can be operated on a set of machines (tanks), and their operation times are bounded. The transportation tasks are performed by several available transport resources. The objective is to determine an assignment of processing and transport resources and valid schedules on them without storage for both processing and transport operations while minimizing makespan. The assignments and schedules can be efficiently modeled by a disjunctive graph: negative arcs present the maximum processing and transportation times, and the length of the longest path without positive cycle represents the makespan of a feasible solution without storage. A modified genetic algorithm is used to do the assignment of tasks on resources. A modified Shifting Bottleneck procedure is applied to find a schedule for both machines’ and transports’ operations for a specific individual. Computational results for benchmark instances with several transport resources are presented.
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.
