default search action
Computers & Operations Research, Volume 90
Volume 90, February 2018
- Lindsey A. McCarty, Amy E. M. Cohn:
Preemptive rerouting of airline passengers under uncertain delays. 1-11 - Mitja Stiglic, Niels A. H. Agatz, Martin W. P. Savelsbergh, Mirko Gradisar:
Enhancing urban mobility: Integrating ride-sharing and public transit. 12-21 - Can Akkan, Ayla Gülcü:
A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem. 22-32 - Purity Mutunge, Dag Haugland:
Minimizing the tracking error of cardinality constrained portfolios. 33-41 - Gorka Kobeaga, María Merino, José Antonio Lozano:
An efficient evolutionary algorithm for the orienteering problem. 42-59 - Yuichi Nagata, Isao Ono:
A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem. 60-71 - Andrzej Jaszkiewicz:
Improved quick hypervolume algorithm. 72-83 - Yuichi Nagata:
Random partial neighborhood search for the post-enrollment course timetabling problem. 84-96 - Xiao Lei, Siqian Shen, Yongjia Song:
Stochastic maximum flow interdiction problems under heterogeneous risk preferences. 97-109 - Nhan-Quy Nguyen, Farouk Yalaoui, Lionel Amodeo, Hicham Chehade, Pascal Toggenburger:
Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function. 110-124 - Douglas José Alem, Eduardo Curcio, Pedro Amorim, Bernardo Almada-Lobo:
A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches. 125-141 - Yuri Laio T. V. Silva, Anand Subramanian, Artur Alves Pessoa:
Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. 142-160 - Hakan Gultekin, Betul Coban, Vahid Eghbal Akhlaghi:
Cyclic scheduling of parts and robot moves in m-machine robotic cells. 161-172 - Nader Ghaffari-Nasab, Alireza Motallebzadeh, Younis Jabarzadeh, Bahar Yetis Kara:
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. 173-192 - Yongliang Lu, Una Benlic, Qinghua Wu:
A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. 193-207 - Fabio Furini, Michele Monaci, Emiliano Traversi:
Exact approaches for the knapsack problem with setups. 208-220 - Rafael Kendy Arakaki, Fábio Luiz Usberti:
Hybrid genetic algorithm for the open capacitated arc routing problem. 221-231 - Bruno C. S. Nogueira, Rian G. S. Pinheiro:
A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs. 232-248 - Mohammad Saleh Farham, Haldun Süral, Cem Iyigun:
A column generation approach for the location-routing problem with time windows. 249-263 - Changchun Liu, Chenjie Wang, Zhi-Hai Zhang, Li Zheng:
Scheduling with job-splitting considering learning and the vital-few law. 264-274
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.