Abstract
Abstract This paper is an attempt to make scheduling of AGVs an integral part of the overall scheduling activity in an FMS environment. The sequence-dependent nature of travel times for the deadheading trips between successive loaded trips of the AGVs increases the problem difficulty. The problem is decomposed into two subproblems, and previous work on machine scheduling and vehicle scheduling has been exploited to arrive at an iterative heuristic procedure where makespan is the performance criterion. At each iteration, a new machine schedule, generated by a heuristic procedure, is investigated for its feasibility to the vehicle scheduling subproblem. The operation completion times obtained from the machine schedule are used to construct time windows for each material handling trip, and the second subproblem is handled as a sliding time window problem. A set of problems are solved to analyse the impact of the process times/travel times ratio on the performance of the procedure. The interaction between the...
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.
