Transporter scheduling based on a network flow model under a dynamic blocktransportation environment

2009 International Conference on Computers and Industrial Engineering, CIE 2009

Volumn , Issue , 2009, Pages 311-316

  Lee, Woon Seek ^a   Lim, Won Il ^a   Koo, Pyung Hoi ^a  

^a Pukyong National University   (South Korea)

Author keywords

Dynamic block transportation environment; Networkflow model; Rolling scheduling; Shipbuilding; Transporter scheduling

Indexed keywords

DELAY TIME; DELIVERY TIME; NETWORKFLOW MODEL; PLANNING HORIZONS; ROLLING SCHEDULING; SCHEDULING PROBLEM; SIMULATION EXPERIMENTS; SPECIFIC TIME; TRANSPORTATION REQUIREMENTS; TRANSPORTER SCHEDULING; TRAVEL TIME; WEIGHTED SUM;

HEURISTIC ALGORITHMS; INDUSTRIAL ENGINEERING; SHIPBUILDING; SHIPS; SHIPYARDS;

SCHEDULING ALGORITHMS;

EID: 77956098577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Baker, E. K., "An exact algorithm for the time-constrained travelingsalesman problem", Opns. Res. 31, pp939-945, 1983
2. Bard, J. F., G. Kontoravdis, and G. Yu, "A branch-and-cut procedurefor the vehicle routing problem with time windows", Transportation Sci. 36,pp250-269, 2002
3. Bianco, L., A. Mingozzi, and S. Sicciardelli, "Dynamic programmingstrategies for the traveling salesman problem with time windows and precedenceconstraints", Opns. Res. 45, pp365-378, 1998
4. Calvo, R. W., "A new heuristic for the traveling salesman problemwith time windows", Transportation Sci. 34, ppl 13-124, 2000
5. Chao, I. M., "A tabu search method for truck and trailer routingproblem", Computers and O.R. 29, pp33-51, 2002
6. Crainic, T. G. and G. Laporte, Fleet management and logistics, KluwerAcademic Publishers, 1998
7. Desrosiers, J., M. Sauve, and F. Soumis, "Lagrangian relaxationmethods for solving the minimum fleet size multiple traveling salesman problemwith time windows", Management Sci. 34, pp1005-1022, 1988
8. Dumas, Y., J. Desrosiers, E. Gelinas, and M. M. Solomon, "An optimalalgorithm for the traveling salesman problem with time windows", Opns.Res. 45, pp367-371, 1995
9. Gendreau, M., A. Hertz, G. Laporte, and M. Stan, "A generalizedinsertion heuristic for the traveling salesman problem with time windows",Opns. Res. 46, pp330-335, 1998.
10. Langevin, A., M. Desrochers, J. Desrosiers, and F. Soumis, "A twocommodity flow formulation for the traveling salesman and makespan problems withtime windows", Network 23, pp631-640, 1993
11. Laporte, G. and H. Osman, "Routing problems: a bibliography", Annal of O.R. 61, pp227-262, 1995
12. Joo, C. M., W. S. Lee, P. H. Koo, and K. B. Lee, " Transporterscheduling for block transportation in shipbuilding", J. of the KoreanManagement Engineers Society 11, pp169-179, 2006
13. Maxwell, W. L. and J. A. Muckstadt, "Design of automated guidedvehicle systems", IIE Trans. 14, ppl 14-124, 1982
14. Pesant, G., M. Gendreau, J.-Y. Potvin, J.-M. Rousseau, "An exactconstraint logic programming algorithm for the TSP with time windows",Transportation Sci. 32, pp12-29, 1998
15. Savelsbergh, M. W. P., "Local search in routing problems with timewindows", Ann. Of O.R. 4, pp285-305, 1985