default search action
Annals of Operations Research, Volume 180
Volume 180, Number 1, November 2010
- Graham Kendall, Kay Chen Tan, Edmund K. Burke, Stephen F. Smith:
Preface for the special volume on Computational Intelligence in Scheduling. 1-2 - Christine L. Mumford:
A multiobjective framework for heavily constrained examination timetabling problems. 3-31 - Amina Lamghari, Jacques A. Ferland:
Metaheuristic methods based on Tabu search for assigning judges to competitions. 33-61 - Chun Yew Cheong, Kay Chen Tan, Dikai Liu, C. J. Lin:
Multi-objective and prioritized berth allocation in container ports. 63-103 - Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa Ç. Pinar:
A model and case study for efficient shelf usage and assortment analysis. 105-124 - Humberto Cesar Brandão de Oliveira, Germano Crispim Vasconcelos:
A hybrid search method for the vehicle routing problem with time windows. 125-144 - Carsten Franke, Joachim Lepping, Uwe Schwiegelshohn:
Greedy scheduling with custom-made objectives. 145-164 - Jacomine Grobler, Andries P. Engelbrecht, Schalk Kok, Sarma Yadavalli:
Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time. 165-196 - Pei-Chann Chang, Shih-Hsin Chen, Chin-Yuan Fan, V. Mani:
Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems. 197-211 - Alex Shenfield, Peter J. Fleming, Visakan Kadirkamanathan, Jeff Allan:
Optimisation of maintenance scheduling strategies on the grid. 213-231 - Roman Barták, Ondrej Cepek, Pavel Surynek:
Discovering implied constraints in precedence graphs with alternatives. 233-263 - Jürgen Kuster, Dietmar Jannach, Gerhard Friedrich:
Applying Local Rescheduling in response to schedule disruptions. 265-282
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.