|
Title: Discrete time formulation for the assignment problem applied in cross docking facilities
Accession Number: 01363924
Record Type: Component
Abstract: Assignment problems arise in different situations in transportation and are a well-studied topic in combinatorial optimization. Despite this fact, few works have been published on the use of a discrete time formulation. In this paper two new mathematical formulations are presented for the scheduling of inbound trucks to doors at a cross dock facility, and compared to the classical machine scheduling formulation.In the first formulation a continuous time representation is considered (similar to the classical one commonly found in the literature). In the second formulation, a discrete time representation is proposed. Numerical results, obtained using an exact algorithm, are presented in order to illustrate and critically discuss each formulation.
Supplemental Notes: This paper was sponsored by TRB committee AT050(1) AT050 Paper Review Subcommittee
Monograph Title: Monograph Accession #: 01362476
Report/Paper Numbers: 12-3970
Language: English
Corporate Authors: Transportation Research Board 500 Fifth Street, NW Authors: Saharidis, G K DGolias, M MZhang, TPagination: 12p
Publication Date: 2012
Conference:
Transportation Research Board 91st Annual Meeting
Location:
Washington DC, United States Media Type: Digital/other
Features: Figures; References; Tables
TRT Terms: Uncontrolled Terms: Subject Areas: Freight Transportation; Operations and Traffic Management; Terminals and Facilities; I71: Traffic Theory
Source Data: Transportation Research Board Annual Meeting 2012 Paper #12-3970
Files: PRP, TRIS, TRB
Created Date: Feb 8 2012 5:20PM
|