All Stories

  1. Solving the medical student scheduling problem using simulated annealing
  2. Reinforcement Learning for Multi-Neighborhood Local Search in Combinatorial Optimization
  3. Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem
  4. Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities
  5. Local Search for Integrated Predictive Maintenance and Scheduling in Flow-Shop
  6. Simulated Annealing for the Home Healthcare Routing and Scheduling Problem
  7. Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities
  8. Task design in complex crowdsourcing experiments: Item assignment optimization
  9. Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results
  10. Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
  11. Exact and metaheuristic approaches for unrelated parallel machine scheduling
  12. Multi-Neighborhood Simulated Annealing for the Minimum Interference Frequency Assignment Problem
  13. Correction to: Solving a home energy management problem by Simulated Annealing
  14. Solving a home energy management problem by SA
  15. Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods
  16. Local Search and Constraint Programming for a Real-World Examination Timetabling Problem
  17. Modelling and solving the thesis defense timetabling problem
  18. The practice and theory of automated timetabling (2016)
  19. Modeling and solving the steelmaking and casting scheduling problem
  20. The Second International Nurse Rostering Competition
  21. Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming
  22. Modeling and solving a real-life multi-skill shift design problem
  23. Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
  24. Feature-based tuning of single-stage simulated annealing for examination timetabling
  25. Comments on: An overview of curriculum-based course timetabling
  26. Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
  27. Local search techniques for a routing-packing problem
  28. The generalized balanced academic curriculum problem with heterogeneous classes
  29. The Third International Timetabling Competition
  30. Automated Shift Design and Break Scheduling
  31. Modeling and solving the dynamic patient admission scheduling problem under uncertainty
  32. Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
  33. The first international nurse rostering competition 2010
  34. XHSTT: an XML archive for high school timetabling problems in different countries
  35. Hybrid metaheuristics for constrained portfolio selection problems
  36. Local search and lower bounds for the patient admission scheduling problem
  37. Local search for a multi-drop multi-container loading problem
  38. Design and statistical analysis of a hybrid local search algorithm for course timetabling
  39. The balanced academic curriculum problem revisited
  40. Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings
  41. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs
  42. Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
  43. Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
  44. A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
  45. Multi-neighborhood Local Search for the Patient Admission Problem
  46. Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
  47. The minimum shift design problem
  48. Simulation of fuel consumption and emissions in typical traffic circumstances in Belgium
  49. A composite-neighborhood tabu search approach to the traveling tournament problem
  50. Hybrid Local Search for Constrained Financial Portfolio Selection Problems
  51. Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals
  52. EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
  53. EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms
  54. Floating Automotive Data Collection
  55. Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems
  56. Simulations of Fuel Consumption and Emissions in Typical Traffic Circumstances
  57. Compiling problem specifications into SAT
  58. Theory and Practice of the Minimum Shift Design Problem
  59. Local search for shift design
  60. Writing Local Search Algorithms Using Easylocal++
  61. Multi-neighbourhood Local Search with Application to Course Timetabling
  62. The Minimum Shift Design Problem: Theory and Practice
  63. EASYLOCAL++: an object-oriented framework for the flexible design of local-search algorithms
  64. Tabu Search Techniques for Examination Timetabling
  65. NP-SPEC: an executable specification language for solving all problems in NP
  66. LOCAL++: A C++ framework for local search algorithms
  67. LOCAL++: A C++ framework for local search algorithms
  68. Solving Employee Timetabling Problems by Generalized Local Search
  69. Local search techniques for large high school timetabling problems
  70. The Alma Project, or How First-Order Logic Can Help us in Imperative Programming
  71. Alma-O: an imperative language that supports declarative programming
  72. An epistemic operator for description logics
  73. A refined architecture for terminological systems: Terminology = Schema + Views
  74. np-spec: An Executable Specification Language for Solving All Problems in NP
  75. Search and imperative programming
  76. Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae
  77. Reasoning with individuals in concept languages
  78. Deduction in Concept Languages: from Subsumption to Instance Checking
  79. Queries, rules and definitions as epistemic sentences in concept languages
  80. On the complexity of the instance checking problem in concept languages with existential quantification
  81. Reasoning with individuals in concept languages
  82. On the complexity of the instance checking problem in concept languages with existential quantification
  83. A hybrid system with datalog and concept languages
  84. Compiling Problem Specifications into SAT
  85. Querying concept-based knowledge bases
  86. Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
  87. LOCAL++: a C++ framework for local search algorithms