Name
Abstract | ||
|---|---|---|
This paper describes a problem for rearranging floor layouts and proposes a system which makes up a plan and schedule synchronously. Rearrangement of a floor layout (RAFL) is a search problem, which consists of pre- and postchange layouts of-objects, workers, and a work hour limit. The goal in solving RAFL is to find a pair of rearrangement plan and its schedule. RAFL deals with planning and scheduling simultaneously, whereas a schedule is usually determined after a plan is found. In RAFL, even if an optimal plan is obtained in advance, a schedule consisting of its elements may not be necessarily feasible. The proposed system uses constraints to represent required knowledge and tree search algorithm. The system is interactive and informs users of search progress. Users may interrupt a search at any time to correct the system if its search is too slow or reaches an insufficient solution. Experimental results show that the system interacted with the user can find a valid solution in scores of minutes, where the time to solve is considerably reduced. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/ICSMC.2001.972984 | 2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE |
Keywords | Field | DocType |
planning, scheduling, constraint, search, user interaction, rearrangement of floor layouts | Production control,Scheduling (computing),Computer science,Facility location problem,Artificial intelligence,Search problem,Interrupt,Constraint satisfaction,Mathematical optimization,Tree traversal,Simulation,User interface,Machine learning | Conference |
ISSN | Citations | PageRank |
1062-922X | 1 | 0.39 |
References | Authors | |
7 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Satoshi Ono | 1 | 219 | 39.83 |
| Yoshinobu Hamada | 2 | 3 | 1.56 |
| Shinji Yamamoto | 3 | 94 | 16.35 |
| Kazunori Mizuno | 4 | 42 | 10.55 |
| Seiichi Nishihara | 5 | 71 | 14.35 |