Dynamic programming algorithm on two machines cross docking scheduling with total weighted completion time

Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University

Volumn 41, Issue 5, 2007, Pages 852-856

  Ma, Dong Yan ^a,b   Chen, Feng ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b NINGXIA UNIVERSITY   (China)

Author keywords

Cross docking; Distribution; Dynamic programming; Logistics; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DOCKING; DYNAMIC PROGRAMMING; OPTIMIZATION; SCHEDULING;

CROSS DOCKING DISTRIBUTION; CUSTOMER DEMAND; PROCESSING JOB; SHIPPING STAGE;

LOGISTICS;

EID: 34347237648     PISSN: 10062467     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. Li Y, Lim A. Cross docking - JIT scheduling with time windows [J]. Journal of the Operational Research Society, 2004, 55: 1342-1351.
2. Heragu S S, Jason C, Huang S. A mathematical model for warehouse design and product allocation [J]. International Journal of Production Research, 2003, 4: 122-131.
3. XU Tian-liang. The expected total cost method of lateral transshipment in a cross-docking system with stochastic demand [J]. Industrial Engineering and Management, 2004(1): 27-31.
4. Donaldson H, Johnson E L, Ratliff H D, et al. Schedule-driven cross-docking networks [EB/OL]. (2003-10-08). http://www2.isye.gatech.edu/-jvandeva/ Classes/6203/Load-driven2-9-04.doc.
5. CHEN Feng, SONG Kai-lei. Cross docking logistics scheduling problem and its approximation and exact algorithms [J]. Industrial Engineering and Management, 2006(6): 53-58.
6. Garey M R, Johnson D S, Stethi R. The complexity of flowshop and jobshop scheduling [J]. Mathematical operations research, 1976, 13: 330-348.
7. Liaw C F. Scheduling two-machine preemptive open shops to minimize total completion time [J]. Computers and Operations Research, 2004, 31: 1349-1363.
8. Shabtay D, Kaspi M. Minimizing the total weighted flow time in a single machine with controllable processing times [J]. Computers and Operations Research, 2004, 31: 2279-2289.
9. Lee C Y. A new dynamic programming algorithm for the parallel machines total weighted completion time problem [J]. Operations Research Letters, 1992, 11: 73-75.