Job Shop
We are given a number of tasks, amount of resources and a deadline. Each task is associated with a duration and amount of resources that it takes up during the execution. The goal is to find a schedule to execute the tasks so that every task is finished before the deadline.

The optimization version is to minimize the time that a given task is finished.

Newspaper  
We are given a number of persons and newspapers. Each person spends different amount of time when reading different newspapers (due to his or her interests). The goal of is to find a schedule for the persons to read the newspapers such that no newspaper is read by more than one person at a time, no person read more than one newspaper at a time, each person finishes all the newspapers before a given deadline,

The optimization version is to minimize the time that a given person finishes reading a given newspaper.

RoutingMax 
We have a network consisting of nodes connected by edges. Each edge has some delay in transmitting a packet along the edge and some profit gained by transmitting a packet. Some nodes are critical and each critical node is associated with a deadline. The goal is to find a route to transmit a packet, so that each critical node is reached by the packet within the deadline.

The optimization version is to maximize the profit of transmitting the packet to a given node along the route.

RoutingMin
Similar to RoutingMax. The difference is that there is no profit associate to the edges.

The optimization version is to minimize the delay of transmitting the packet to a given node along the route. 

Disjunctive Scheduling
Given a set of task intervals each of which has a fixed duration, an earliest starting time, and a latest ending time; a set of precedence constraints each of which states that one task must be completed before another; and a set of disjunctive constraints each of which states that two task intervals cannot overlap each other. The goal of disjunctive scheduling is to assign a starting time (an integer) to each task such that the given constraints are all satisfied.

The optimization version is to minimize the ending time of a given task in a schedule.

Hamiltonian Cycle
We are given a directed graph and the distance of each edge in the graph. The goal is to find a cycle that reaches each node of the graph exactly once (Hamiltonian cycle).

The optimization version is to find a Hamiltonian cycle which is of minimum distance to a specific node of the graph.
