default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 80
Volume 80, April 2017
- Wen Jiao
, Ju-Liang Zhang, Hong Yan:
The stochastic lot-sizing problem with quantity discounts. 1-10 - Wei-Wei Cui, Zhiqiang Lu:
Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates. 11-22 - Majid Eskandarpour, Pierre Dejax, Olivier Péton:
A large neighborhood search heuristic for supply chain network design. 23-37 - Aykut Melih Turhan, Bilge Bilgen:
Mixed integer programming based heuristics for the Patient Admission Scheduling problem. 38-49 - Quan-Ke Pan, Rubén Ruiz, Pedro Alfaro-Fernández:
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. 50-60 - Federico Della Croce, Fabio Salassa, Rosario Scatamacchia:
An exact approach for the 0-1 knapsack problem with setups. 61-67 - T. C. van Barneveld, Robert D. van der Mei, Sandjai Bhulai:
Compliance tables for an EMS system with two types of medical response units. 68-81 - Tom Pape:
Value of agreement in decision analysis: Concept, measures and application. 82-93 - Claudio Arbib, Mara Servilio, Paolo Ventura:
An improved integer linear programming formulation for the closest 0-1 string problem. 94-100 - Muh-Cherng Wu, Chi-Shiuan Lin, Chia-Hui Lin, Chen-Fu Chen:
Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems. 101-112 - Lijun Wei, Qian Hu, Stephen C. H. Leung, Ning Zhang:
An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation. 113-127 - Francisco López-Ramos, Esteve Codina, Ángel Marín, Armando Guarnaschelli:
Integrated approach to network design and frequency setting problem in railway rapid transit systems. 128-146 - Sonia Cafieri, David Rey:
Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming. 147-158 - Frédéric Quesnel, Guy Desaulniers, François Soumis:
A new heuristic branching scheme for the crew pairing problem with base constraints. 159-172 - N. Rafiee Parsa, Behrooz Karimi, S. M. Moattar Husseini:
Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system. 173-183 - Breno Piva, Cid C. de Souza:
Minimum stabbing rectangular partitions of rectilinear polygons. 184-197
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 2025-01-31 22:50 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:
