Benchmarks
Set of benchmarks provided for research purposes. Use the search to quickly find a benchmark by keyword (energy, open-shop, job-shop, berth…).
Type a keyword (e.g., “energy”, “open-shop”, “JSMS”, “BAP”…).
Click and read the details. Use the search box to filter instantly.
PSPLIB-ENERGY library is an extension of the Project Scheduling Problem Library – PSPLIB to provide problem sets for evaluation of energy optimization in resource constrained project scheduling problems.
- Data of activities, durations and resource requirements are the same, as they are obtained from PSPLIB.
- Each activity can be performed under different energy requirements. Each alternative energy consumption involves different execution duration.
- The goal is to plan the activity sequence and energy consumption in order to maximize energy efficiency (minimize makespan + energy).
The faced problem consists in scheduling off-line a set of orders on a set of parallel injection moulding presses, where each order is characterised by a product type and a penalty cost for late delivery.
- Alternative presses are available for each order; processing time and energy depend on the order-machine pair.
- Setup times must be considered (mould change and cleaning) between successive operations on the same press.
- Multi-objective: minimize total tardiness, total setup time and total energy consumption.
- Analogous to scheduling independent jobs on unrelated parallel machines with sequence- and machine-dependent setups; belongs to NP-hard problems.
We focus on a job-shop scheduling problem where machines can work with different energy consumptions. It is an extension of the classical job-shop scheduling problem, where each operation is executed by one machine and the machine can work at different voltage.
- Traditional indicators (processing time, cost, quality) are common objectives, but energy is often ignored.
- Each operation is executed by one machine that can run at different energy consumptions (different voltage).
The Berth Allocation Problem (BAP) assigns berthing positions and mooring times to incoming vessels. The Quay Crane Assignment Problem (QCAP) assigns quay cranes to each moored vessel to fulfill container movements.
- No benchmark was available in the literature for these problems.
- A corpus of 100 instances is provided, randomly generated following suggestions of real-world container terminal operators.