Transporter Scheduling for Dynamic Block Transportation Environment |
Lee, Woon-Seek
(Systems Management and Engineering, Pukyong National University)
Lim, Won-Il (Systems Management and Engineering, Pukyong National University) Koo, Pyung-Hoi (Systems Management and Engineering, Pukyong National University) Joo, Cheol-Min (System and Management Engineering, Dongseo University) |
1 | Baker, E. K. (1983), An Exact Algorithm for the Time-Constrained Traveling Salesman Problem, Opns. Res., 31, 939-945 |
2 | Chao, I. M. (2002), A Tabu Search Method for Truck and Trailer Routing Problem, Computers and O.R., 29, 33-51 DOI ScienceOn |
3 | Crainic, T. G. and Laporte, G. (1998), Fleet Management and Logistics, Kluwer Academic Publishers |
4 | Desrosiers, J., Sauve, M., and Soumis, F. (1988), Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows, Management Sci., 34, 1005-1022 DOI ScienceOn |
5 | Ha, T. R., Moon, C. U., Joo, C. M., and Park, J. C. (2000), A Hybrid Genetic Algorithm for Scheduling of the Panel Block Assembly Shop in Shipbuilding, Management Science, 17(1), 135-143 |
6 | Koo, P. H., Lee, W. S., and Jang, D. W. (2004), Fleet Sizing and Vehicle Routing for Container Transportation in a Static Environment, OR Spectrum, 26, 193-209 DOI |
7 | Laporte, G. and Osman, H. (1995), Routing Problems: a Bibliography, Annal of OR., 61, 227-262 DOI ScienceOn |
8 | Savelsbergh, M. W. P. (1985), Local Search in Routing Problems with Time Windows, Ann. Opns. Res., 4, 285-305 DOI |
9 | Pesant, G., Gendreau, M., Potvin, J.-Y., and Rousseau, J.-M. (1998), An Exact Constraint Logic Programming Algorithm for the TSP with Time Windows, Transportation Sci., 32, 12-29 DOI ScienceOn |
10 | Chung, K. H., Baek, T. H., Min, S. G., Kim, H. S., Park, J. C., Cho. K. K., and Park, C. K. (2001), Development of the Spatial Scheduling System and Its Applications in Shipbuilding Industry, IE Interfaces, 14(4), 394-402 |
11 | Ko, C. S., Jung, K. H., and Shin, J. Y. (2000), Determination of Vehicle Fleet Size for Container Shuttle Service, Management Science, 17(2), 87-95 |
12 | Dumas, Y., Desrosiers, J., Gelinas, E., and Solomon, M. M. (1995), An Optimal Algorithm for the Traveling Salesman Problem with Time Windows, Opns. Res., 45, 367-371 |
13 | Gendreau, M., Hertz, A., Laporte, G., and Stan, M. (1998), A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows, Opns. Res., 46, 330-335 DOI ScienceOn |
14 | Koh, S. G., Park, J. C., Choi, Y. S., and Joo, C. M. (1999), Development of a Block Assembly Scheduling System for Shipbuilding Company, IE Interfaces, 12(4), 586-594 |
15 | Bianco, L., Mingozzi, A., and Sicciardelli, S. (1998), Dynamic Programming Strategies for the Traveling Salesman Problem with Time Windows and Precedence Constraints, Opns. Res., 45, 365-378 DOI ScienceOn |
16 | Maxwell, W. L. and Muckstadt, J. A. (1982), Design of Automated Guided Vehicle Systems, IIE Trans., 14, 114-124 |
17 | Calvo, R. W. (2000), A New Heuristic for the Traveling Salesman Problem with Time Windows, Transportation Sci., 34, 113-124 DOI ScienceOn |
18 | Langevin, A., Desrochers, M., Kesrosiers, J., and Foumis, F. (1993), A Two Commodity Flow Formulation for the Traveling Salesman and Makespan Problems with Time Windows, Network, 23, 631-640 DOI ScienceOn |
19 | Park, M. H., Lee, W. S., Ock, Y. S., and Lee, T. E. (1995), A Review of Korean Shipbuilding Industry and Industrial Engineering Research, IE Interfaces, 8(2), 5-20 |
20 | Bard, J. F., Kontoravdis, G., and Yu, G. (2002), A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows, Transportation Sci., 36, 250-269 DOI ScienceOn |
21 | Joo, C. M., Lee, W. S., Koo, P. H., and Lee, K. B. (2006), Transporter Scheduling for Block Transportation in Shipbuilding, J. of the Korea Management Engineers Society, 11(3), 169-179 |