Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 100
Volume 100, December 2018
- Yang Zhan
, Guohua Wan:
Vehicle routing and appointment scheduling with team assignment for home services. 1-11 - Lei He, Xiaolu Liu, Gilbert Laporte, Yingwu Chen, Yingguo Chen:
An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling. 12-25 - Rainer Schlosser, Martin Boissier:
Dealing with the dimensionality curse in dynamic pricing competition: Using frequent repricing to compensate imperfect market anticipations. 26-42 - Desiree Maldonado Carvalho, Mariá C. V. Nascimento:
A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over. 43-53 - Yongha Kang, Erinç Albey, Reha Uzsoy:
Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior. 54-65 - Mehran Hojati:
A greedy heuristic for shift minimization personnel task scheduling problem. 66-76 - Taewoon Kong, Kyungje Seong, Kiburm Song, Kichun Lee:
Two-mode modularity clustering of parts and activities for cell formation problems. 77-88 - Moncef Ilies Nasri, Tolga Bektas, Gilbert Laporte:
Route and speed optimization for autonomous trucks. 89-101 - Meng Qiu, Zhuo Fu, Richard W. Eglese, Qiong Tang:
A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups. 102-116 - Lucie Pansart, Nicolas Catusse, Hadrien Cambazard:
Exact algorithms for the order picking problem. 117-127 - Mesut Yavuz, Hüseyin Ergin:
Advanced constraint propagation for the combined car sequencing and level scheduling problem. 128-139 - Nader Ghaffari-Nasab, Tom Van Woensel, Stefan Minner:
A continuous approximation approach to the planar hub location-routing problem: Modeling and solution algorithms. 140-154 - Nicolas Danloup, Hamid Allaoui, Gilles Goncalves:
A comparison of two meta-heuristics for the pickup and delivery problem with transshipment. 155-171 - Merve Keskin, Bülent Çatay:
A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. 172-188 - David Boywitz, Nils Boysen:
Robust storage assignment in stack- and queue-based storage systems. 189-200 - Marta Cabo, José Luis González Velarde, Edgar Possani, Yasmín Á. Ríos-Solís:
Bi-objective scheduling on a restricted batching machine. 201-210 - Chunlong Yu, Quirico Semeraro, Andrea Matta:
A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. 211-229 - Alexander J. Benavides, Marcus Ritt:
Fast heuristics for minimizing the makespan in non-permutation flow shops. 230-243 - Ricardo J. Gomes, Andreia P. Guerreiro, Tobias Kuhn, Luís Paquete:
Implicit enumeration strategies for the hypervolume subset selection problem. 244-253 - Matthias Mnich, René van Bevern:
Parameterized complexity of machine scheduling: 15 open problems. 254-261
- Kannan Govindan, T. C. E. Cheng:
Advances in stochastic programming and robust optimization for supply chain planning. 262-269 - Laureano F. Escudero, Juan Francisco Monge, Dolores Romero Morales:
On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty. 270-286 - Aly Megahed, Marc Goetschalckx:
Tactical supply chain planning under uncertainty with an application in the wind turbines industry. 287-300 - Xiang Li, Yongjian Li:
On the loss-averse dual-sourcing problem under supply disruption. 301-313 - Mohammad Fattahi, Kannan Govindan, Esmaeil Keyvanshokooh:
A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands. 314-332 - Nabil Kenan, Aida Jebali, Ali Diabat:
An integrated flight scheduling and fleet assignment problem under uncertainty. 333-342 - Mohammad Izadikhah, Reza Farzipoor Saen:
Assessing sustainability of supply chains by chance-constrained two-stage DEA model in the presence of undesirable factors. 343-367 - SeJoon Park, Changsoo Ok, Chunghun Ha:
A stochastic simulation-based holistic evaluation approach with DEA for vendor selection. 368-378 - Florian Taube, Stefan Minner:
Data-driven assignment of delivery patterns with handling effort considerations in retail. 379-393 - Jafar Heydari, Payam Zaabi-Ahmadi, Tsan-Ming Choi:
Coordinating supply chains with stochastic demand by crashing lead times. 394-403
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 04:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
