Abstract
This paper is an attempt to make the AGV scheduling 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 an iterative solution procedure is developed where the operation completion times obtained from the machine schedule subproblem by means of an heuristic are used to construct time windows for each material handling trip in the vehicle scheduling subproblem which is handled as a sliding time window problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
