default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 72
Volume 72, August 2016
- F. Dong, J. R. Deglise-Hawkinson, Mark P. Van Oyen
, D. J. Singer:
Dynamic control of a closed two-stage queueing network for outfitting process in shipbuilding. 1-11 - Veaceslav Ghilas, Emrah Demir, Tom Van Woensel:
An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines. 12-30 - Jie He, Qingguo Li, Dehua Xu:
Scheduling two parallel machines with machine-dependent availabilities. 31-42 - Hsien-Jen Lin:
Investing in lead-time variability reduction in a collaborative vendor-buyer supply chain model with stochastic lead time. 43-49 - Federico Cabassi, Marco Locatelli:
Computational investigation of simple memetic approaches for continuous global optimization. 50-70 - Yacine Laalaoui, Rym M'Hallah:
A binary multiple knapsack model for single machine scheduling with machine unavailability. 71-82 - Vladimir Rankovic, Mikica Drenovak, Branko Urosevic, Ranko Jelic:
Mean-univariate GARCH VaR portfolio optimization: Actual portfolio approach. 83-92 - Abbasali Jafari, Hassan Khademi-Zare, Mohammad Mehdi Lotfi, Reza Tavakkoli-Moghaddam:
A note on "minimizing makespan in three machine flow shop with deteriorating jobs". 93-96 - Wouter Lefever, El-Houssaine Aghezzaf, Khaled Hadj-Hamou:
A convex optimization approach for solving the single-vehicle cyclic inventory routing problem. 97-106 - Yan Li, Nan Kong, Mengnan Chen, Qipeng P. Zheng:
Optimal physician assignment and patient demand allocation in an outpatient care network. 107-117 - Xiangjing Lai, Jin-Kao Hao:
A tabu search based memetic algorithm for the max-mean dispersion problem. 118-127 - Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner:
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. 128-146 - Lucas de Oliveira, Cid C. de Souza, Tallys H. Yunes:
Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm. 147-159 - Paula Amaral, Tiago Cardal Pais:
Compromise ratio with weighting functions in a Tabu Search multi-criteria approach to examination timetabling. 160-174 - Gökhan Ceyhan, Özgür Özpeynirci:
A branch and price algorithm for the pharmacy duty scheduling problem. 175-182 - Deming Lei, Xiuping Guo:
Variable neighborhood search for the second type of two-sided assembly line balancing problem. 183-188 - Jian-hua Lin, Min Liu, Jinghua Hao, Shenglong Jiang:
A multi-objective optimization approach for integrated production planning under interval uncertainties in the steel industry. 189-203 - Banu Soylu, Gazi Bilal Yildiz:
An exact algorithm for biobjective mixed integer linear programming problems. 204-213
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-10-31 20:03 CET 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:
