Resource Availability Cost Problems

Instances and identifiers are described in Kreter, S.; Schutt, A.; Stuckey, P.J.; Zimmermann, J. (2016): Mixed-integer Linear Programming and Constraint Programming Formulations for Solving Resource Availability Cost Problems, submitted to European Journal of Operational Research.

Multi-project management given multi-skilled workers with heterogeneous skill levels

Resource-constrained project scheduling problem with general temporal constraints and calendars

  • We use the identifiers from Kreter, S.; Rieck, J.; Zimmermann, J. (2016): Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars, European Journal of Operational Research 251 (2), 387-403. Instances with 200 and 500 activities, respectively, were introduced in Kreter, S.; Schutt, A.; Stuckey, P.J. (2016): Using constraint programming for solving RCPSP/max-cal, submitted to Constraints.
  • Input-strucutre of the testsets.
  • Testset 10-60; Results 10-60.
  • Testset 10-80; Results 10-80.
  • Testset 20-60; Results 20-60.
  • Testset 20-80; Results 20-80.
  • Testset 50-60; Results 50-60.
  • Testset 50-80; Results 50-80.
  • Testset 100-60; Results 100-60.
  • Testset 100-80; Results 100-80.
  • Testset 200-60; Results 200-60.
  • Testset 200-80; Results 200-80.
  • Testset 500-60; Results 500-60.
  • Testset 500-80; Results 500-80.

Single mode resource levelling problem

  • We use the identifiers from Neumann, K.; Schwindt, C.; Zimmermann, J.:
    Project Scheduling with Time Windows and Scarce Resources: 2nd ed. Springer, Berlin, 2003.
  • Input-structure of the testsets.
  • Exact results for instances with 10-50 activities.
  • Heuristical results for instances with 50-1000 activities.

Vehicle routing with simultaneous delivery and pick-up

  • We use the identifiers from Rieck, J.; Zimmermann, J.:
    Exact solutions to the symmetric and asymmetric vehicle routing problem with simultaneous delivery and pick-up, Technical Report (2012), Clausthal University of Technology.

Many-to-many Location-Routing with Inter-Hub Transport and Multi-Commodity Pickup-and-Delivery

Machine scheduling in underground mining: An application in the potash industry

  • We use the identifiers from Schulze, M.; Rieck, J.; Seifi, C.; Zimmermann, J. (2016): Machine scheduling in underground mining: an application in the potash industry, OR Spectrum, 38(2), 365-403.
  • Input structure of the testsets.
  • Testset 30_5.
  • Testset 60_10.
  • Testset 120_20.
  • Testset 120_15.
  • Testset 240_30.
  • Testset 240_20.

Unit Commitment Problem with Hydro-Thermal Coordination

Instances and identifiers are described within in the article "A Long-Term Unit Commitment Problem with Hydro-Thermal Coordination for Economic and Emission Control in Large-Scale Electricity Systems" by Franz, A. and Zimmermann, J. (submitted to Journal OR Spectrum).

 

Kontakt  Sitemap  Impressum
© TU Clausthal 2017