default search action
Simulation Modelling Practice and Theory, Volume 46
Volume 46, August 2014
- Gabriella Dellino, Carlo Meloni, Henri Pierreval:
Simulation-optimization of complex systems: Methods and applications. 1-3
- Egidio Quaglietta:
A simulation-based approach for the optimal design of signalling block layout in railway networks. 4-24 - Caner Hamarat, Jan H. Kwakkel, Erik Pruyt, Erwin T. Loonen:
An exploratory approach for adaptive policymaking by using multi-objective robust optimization. 25-39 - Angel A. Juan, Scott E. Grasman, José Cáceres-Cruz, Tolga Bektas:
A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs. 40-52 - Gabriel Zambrano Rey, Therese Bonte, Vittaldas V. Prabhu, Damien Trentesaux:
Reducing myopic behavior in FMS control: A semi-heterarchical simulation-optimization approach. 53-75 - James T. Lin, Chao-Jung Huang:
A simulation-based optimization approach for a semiconductor photobay with automated material handling system. 76-100 - Angel A. Juan, Barry B. Barrios, Eva Vallada, Daniel Riera, Josep Jorba:
A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times. 101-117 - Gonçalo Figueira, Bernardo Almada-Lobo:
Hybrid simulation-optimization methods: A taxonomy and discussion. 118-134 - Aida Huerta-Barrientos, Mayra Elizondo-Cortés, Idalia Flores de la Mota:
Analysis of scientific collaboration patterns in the co-authorship network of Simulation-Optimization of supply chains. 135-148 - Imed Nasri, Georges Habchi, Reda Boukezzoula:
Use of (max, +) algebra for scheduling and optimization of HVLV systems subject to preventive maintenance. 149-163 - Atiyah Elsheikh:
Derivative-based hybrid heuristics for continuous-time simulation optimization. 164-175
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.