相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem
Ning Xue et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
Timo Gschwind et al.
JOURNAL OF SCHEDULING (2020)
Logic-based benders decomposition for scheduling a batching machine
Simon Emde et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
Scheduling direct deliveries with time windows to minimise truck fleet size and customer waiting times
Simon Emde et al.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2019)
Transport concept selection considering supplier milk runs - An integrated model and a case study from the automotive industry
Anne Meyer et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2018)
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
S. Anand et al.
ALGORITHMICA (2017)
An exact algorithm for parallel machine scheduling with conflicts
Daniel Kowalczyk et al.
JOURNAL OF SCHEDULING (2017)
The Benders decomposition algorithm: A literature review
Ragheb Rahmaniani et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)
A Combinatorial Benders' decomposition for the lock scheduling problem
J. Verstichel et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
Part logistics in the automotive industry: Decision problems, literature review and research agenda
Nils Boysen et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem
Ruibin Bai et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2015)
Speed-up Benders decomposition using maximum density cut (MDC) generation
Georgios K. D. Saharidis et al.
ANNALS OF OPERATIONS RESEARCH (2013)
An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
Lixin Tang et al.
ANNALS OF OPERATIONS RESEARCH (2013)
Optimal Constraint Programming Approach to the Open-Shop Problem
Arnaud Malapert et al.
INFORMS JOURNAL ON COMPUTING (2012)
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
Michal Tzur et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)
A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations
Lars Moench et al.
JOURNAL OF SCHEDULING (2011)
The integrated yard truck and yard crane scheduling problem: Blenders' decomposition-based methods
Jin Xin Cao et al.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2010)
Integrated multistage logistics network design by using hybrid evolutionary algorithm
Lin Lin et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2009)
An inventory sharing and allocation method for a multi-location service parts logistics network with time-based service levels
Erhan Kutanoglu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm
Haitao Li et al.
JOURNAL OF SCHEDULING (2009)
An overview on vehicle scheduling models
Stefan Bunte et al.
PUBLIC TRANSPORT (2009)
Replenishment routing problems between a single supplier and multiple retailers with direct delivery
Jing-An Li et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola
Vanda De Angelis et al.
COMPUTERS & OPERATIONS RESEARCH (2007)
Planning and scheduling by logic-based benders decomposition
J. N. Hooker
OPERATIONS RESEARCH (2007)
Vehicle routing problem with time-windows for perishable food delivery
Chaug-Ing Hsu et al.
JOURNAL OF FOOD ENGINEERING (2007)
Computational complexity of some restricted instances of 3-SAT
Piotr Berman et al.
DISCRETE APPLIED MATHEMATICS (2007)
A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor
M. Mathirajan et al.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2006)
Combinatorial benders' cuts for mixed-integer linear programming
Gianni Codato et al.
OPERATIONS RESEARCH (2006)
Logic-based Benders decomposition
JN Hooker et al.
MATHEMATICAL PROGRAMMING (2003)
The Stochastic inventory routing problem with direct deliveries
AJ Kleywegt et al.
TRANSPORTATION SCIENCE (2002)
Scheduling with batching: A review
CN Potts et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
分享论文
