Cross docking scheduling model and heuristic to minimize the number of tardy jobs

zbMATH Open1212.90168MaRDI QIDQ3051667FDOQ3051667

Authors: Liang Yu, Feng Chen 

Publication date: 5 November 2010

Recommendations

• Scheduling Problems in Cross Docking
• Minimizing makespan in two-stage hybrid cross docking scheduling problem
• Crossdocking—JIT scheduling with time windows
• scientific article
• Three-stage hybrid-flowshop model for cross-docking

zbMATH Keywords

heuristic algorithmlogistic optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (6)

• Crossdocking— Just in Time scheduling: an alternative solution approach
• Scheduling Problems in Cross Docking
• Crossdocking—JIT scheduling with time windows
• Dynamic programming algorithm on two machines cross docking scheduling with total weighted completion time
• Minimizing makespan in two-stage hybrid cross docking scheduling problem
• Uncertain milk run-based cross docking scheduling: model and algorithms

This page was built for publication: Cross docking scheduling model and heuristic to minimize the number of tardy jobs

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