Set of bechmarks provided for research purposes:

PSPLIB-ENERGY: a PSPLIB extension for evaluating energy optimization in RCPSP

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 requeriments are the same, as they are obtained from PSPLIB.
• Each activity can be performed under different energy requeriments. Each alternative energy consumption by the activity involves different duration of execution.
• The goal of solving methods is to plan the sequence of activities and energy consumption of each activity in order to maximice energy efficiency (i.e.: minimize the combination of makespan and energy consumption) of projects.

Energy aware Open-shop scheduling problems with different machine-sequence setup times

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. A set of alternative presses is available for each order and both the processing time and the energy consumption depend on the order-machine pair. Since mould change and cleaning are required between two successive operations on the same injection press, also setup times must be considered. Accordingly, the examined case is a multi-objective scheduling problem in which the total tardiness, total setup time and total energy consumption must be minimized. Incidentally, the structure of the studied case is analogous to other manufacturing optimization problems characterized by the scheduling of independent jobs on unrelated parallel machines with sequence and machine dependent setups; since this problem includes as a special case well-known computational intractable problems, such as the single machine total weighted tardiness problem, the discussed case belongs to the class of NP-hard problems.

Job-shop scheduling problem with different speed machines (JSMS)

The traditional scheduling models consider performance indicators such as processing time, cost and quality as optimization objectives. However, most of them do not take into account energy consumption. We focus our attention in a job-shop scheduling problem where machines can work with different energy consumptions. It represents an extension of the classical job-shop scheduling problem, where each operation has to be executed by one machine and this machine can work at different voltage.

Berth Allocation (BAP) + Quay Crane Allocation (QCAP) Problems

The Berth Allocation Problem (BAP) is a well-known combinatorial optimization problem, which consists in assigning berthing positions and mooring times to incoming vessels. The Quay Crane Assignment Problem (QCAP) deals with assigning a certain number of Quay Cranes (QCs) to each moored vessel such that all required movements of containers can be fulfilled. As no benchmark is available in the literature about these problems, we provide a corpus of 100 instances randomly generated, following  suggestions of real-world container terminal operators.