The museum visitor routing problem
Authors:
- Vincent F. YuVincent F. Yu
- Shih-Wei LinShih-Wei Lin
- Shuo-Yan ChouSCShuo-Yan Chou
- 1 April 2010
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 216 (3) , 719-729
Abstract
No abstract availableFunding Information
- National Science Council
This publication has 32 references indexed in Scilit:
- Location-Based Tour Guide System Using Mobile GIS and Web Crawling2005
- A metadata practice of the IFLA FRBR modelJournal of Documentation, 2004
- Solving the open shop scheduling problemJournal of Scheduling, 2001
- Classical and new heuristics for the open-shop problem: A computational evaluationEuropean Journal of Operational Research, 1998
- A branch & bound algorithm for the open-shop problemDiscrete Applied Mathematics, 1997
- The generalized Shifting Bottleneck ProcedureEuropean Journal of Operational Research, 1996
- Constructive heuristic algorithms for the open shop problemComputing, 1993
- Open-shop scheduling problems with dominated machinesNaval Research Logistics (NRL), 1989
- An Algorithm for the Open-Shop ProblemMathematics of Operations Research, 1983
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976