Rescheduling for AGVs by Time Windows Concept
スポンサーリンク
概要
- 論文の詳細を見る
For the operation of automated guided vehicles (AGVs) in factories, the rescheduling of AGV routing is necessary to recover operational delay in AGV routing plans and bridge the gap between the schedule and the practical operation. This study deals with such a rescheduling problem. First, the problem is formulated as a problem of a network with time constraints which are referred to as time windows. Secondly, an algorithm is proposed to obtain two kinds of scheduling information, the earliest arrival time to each node and the latest departure time from each node, to assure the earliest possible arrival of the AGV at a goal node. This algorithm is a dynamic programming method which uses recursion. Lastly, a rescheduling procedure using the information is proposed to recover the practical delay in route scheduling.
- 一般社団法人日本機械学会の論文
- 1995-12-15
著者
-
Fujii Susumu
Faculty Of Engineering Kobe University
-
Hohzaki R
National Defense Acad.
-
Hohzaki Ryusuke
Department Of Applied Physics National Defense Academy
-
Sandoh Hiroaki
Faculty of Information Science, University of Marketing & Distribution Sciences
-
Sandoh Hiroaki
Faculty Of Information Science University Of Marketing & Distribution Sciences
関連論文
- External Beam Radiotherapy Treatment Planning by Mixed Integer Programming
- HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
- AN OPTIMAL SEARCH FOR A DISAPPEARING TARGET WITH A RANDOM LIFETIME
- PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
- AN OPTIMAL DISPATCH PLANNING OF GUARDS TO COUNTER TO A SUICIDE BOMBER
- A SEARCH GAME WITH DURABLE SEARCHING RESOURCES
- OPTIMAL SURVIVOR SEARCH FOR A TARGET WITH CONDITIONALLY DETERMINISTIC MOTION UNDER REWARD CRITERION
- A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS
- Rescheduling for AGVs by Time Windows Concept
- AN OPTIMAL SEARCH PLAN FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
- Efficient Algorithms for a Convex Programming Problem with a Constraint on the Weighted Total Amount
- A MOVING TARGET SEARCH PROBLEM WITH NESTED CONSTRAINTS OF SEARCH EFFORT
- Simulation for Manufacturing Systems
- Preventive Replacement Policy Considering Warranty with Corrective Replacements and Minimal Repairs