default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 60
Volume 60, August 2015
- Hoon Jang, Taesik Lee:
Demand point aggregation method for covering problems with gradual coverage. 1-13 - Javier Alcaraz
, Mercedes Landete, Juan F. Monge, José L. Sainz-Pardo:
Strengthening the reliability fixed-charge location model using clique constraints. 14-26 - Victor Fernandez-Viagas, Jose M. Framiñan:
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. 27-36 - Miguel A. González, Angelo Oddi, Riccardo Rasconi, Ramiro Varela:
Scatter search with path relinking for the job shop with time lags and setup times. 37-54 - Carlos García-Martínez, Christian Blum, Francisco J. Rodríguez, Manuel Lozano:
The firefighter problem: Empirical results on random graphs. 55-66 - Simge Yelkenci Köse, Ozcan Kilincci:
Hybrid approach for buffer allocation in open serial production lines. 67-78 - Lu Zhen, Kai Wang:
A stochastic programming model for multi-product oriented multi-channel component replenishment. 79-90 - Quande Qin, Shi Cheng, Qingyu Zhang, Yiming Wei, Yuhui Shi:
Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization. 91-110 - Preetam Dasgupta, Swagatam Das:
A Discrete Inter-Species Cuckoo Search for flowshop scheduling problems. 111-120 - Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Monica Gentili, Andrea Raiconi:
Maximizing lifetime in wireless sensor networks with multiple sensor families. 121-137 - Anuradha Banerjee, U. C. Gupta, S. R. Chakravarthy:
Analysis of a finite-buffer bulk-service queue under Markovian arrival process with batch-size-dependent service. 138-149 - Ioannis X. Tassopoulos, Ioannis P. Solos, Grigorios N. Beligiannis:
Α two-phase adaptive variable neighborhood approach for nurse rostering. 150-169
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-04-26 00:08 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:
