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

MaRDI QIDQ3609943zbMATH OpenFDO

Authors Dongyan Ma, Feng Chen

Publication date 6 March 2009

zbMATH Keywords

distributiondynamic programminglogisticsschedulingcross docking

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Recommendations

• Scheduling Problems in Cross Docking
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Cross docking scheduling model and heuristic to minimize the number of tardy jobs
• Crossdocking—JIT scheduling with time windows
• Minimizing makespan in two-stage hybrid cross docking scheduling problem

Cited in

(3)

• A genetic algorithm to minimize the makespan in a two-machine cross-docking flow shop problem
• Minimizing makespan in two-stage hybrid cross docking scheduling problem
• A multiobjective mathematical model for truck scheduling problem in multidoor cross-docking system

This page was built for publication: Dynamic programming algorithm on two machines cross docking scheduling with total weighted completion time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609943)