default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 91
Volume 91, March 2018
- Rafael Martí, Anna Martínez-Gavara
, Jesús Sánchez-Oro, Abraham Duarte:
Tabu search for the dynamic Bipartite Drawing Problem. 1-12 - Maciej Drwal:
Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty. 13-20 - Esmaeil Mehdizadeh, Seyed Taghi Akhavan Niaki, Mojtaba Hemati:
A bi-objective aggregate production planning problem with learning effect and machine deterioration: Modeling and solution. 21-36 - Xin Wang, Mari Jevne Arnesen, Kjetil Fagerholt, Magnhild Gjestvang, Kristian Thun:
A two-phase heuristic for an in-port ship routing problem with tank allocation. 37-47
- Hang Ren, Tingliang Huang:
Modeling customer bounded rationality in operations management: A review and research opportunities. 48-58
- Sarang Kulkarni, Rahul Patil, Mohan Krishnamoorthy, Andreas T. Ernst, Abhiram Ranade:
A new two-stage heuristic for the recreational vehicle scheduling problem. 59-78
- Çagri Koç, Gilbert Laporte:
Vehicle routing with backhauls: Review and research perspectives. 79-91
- Marlon C. Monçores, Adriana C. F. Alvim, Márcio de Oliveira Barros:
Large Neighborhood Search applied to the Software Module Clustering problem. 92-111 - Ilya Bychkov, Mikhail Batsyn:
An efficient exact model for the cell formation problem with a variable number of production cells. 112-120 - Bruno Jefferson de S. Pessoa, Daniel Aloise, Lucídio dos Anjos F. Cabral:
The Weighted Fair Sequences Problem. 121-131 - I. Esra Büyüktahtakin, J. Cole Smith, Joseph C. Hartman:
Partial objective inequalities for the multi-item capacitated lot-sizing problem. 132-144 - Tarik Aouam, Kobe Geryl, Kunal Kumar, Nadjib Brahimi:
Production planning with order acceptance and demand uncertainty. 145-159 - Leonardo de Lima Correa, Bruno Borguesan, Mathias J. Krause, Márcio Dorn:
Three-dimensional protein structure prediction based on memetic algorithms. 160-177 - Niels-Christian Fink Bagger, Matias Sørensen, Thomas R. Stidsen:
Benders' decomposition for curriculum-based course timetabling. 178-189 - Luís Gouveia, Martim Joyce-Moniz, Markus Leitner:
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints. 190-208 - Alain Hertz, Romain Montagné, François Gagnon:
Online algorithms for the maximum k-colorable subgraph problem. 209-224 - Yichen Qin, Felix T. S. Chan, Sai Ho Chung, Ting Qu, Ben Niu:
Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers. 225-236 - Javad Lessan, Selçuk Karabati:
A preference-based, multi-unit auction for pricing and capacity allocation. 237-246 - Eduardo Camponogara, Luiz Alberto Guardini, Leonardo Salsano de Assis:
Scheduling pumpoff operations in onshore oilfields with electric-power constraints and variable cycle time. 247-257
- Horst Tempelmeier, Michael Kirste, Timo Hilger:
Linear programming models for a stochastic dynamic capacitated lot sizing problem. 258-259
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 2026-06-10 22:51 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:
