The industrial sector is one of the largest energy consumers in the world. To alleviate the
grid's burden during peak hours, time-of-use (TOU) electricity pricing has been implemented …

This paper presents an exact algorithm for the identical parallel machine scheduling
problem over a formulation where each variable is indexed by a pair of jobs and a …

In this article, we formulate the vehicle routing problem with time windows and temporal
dependencies. The problem is an extension of the well studied vehicle routing problem with …

This paper studies a generalization of the order acceptance and scheduling problem in a
single-machine environment where a pool consisting of firm planned orders as well as …

Unrelated parallel machines scheduling problems with random rework have many industrial
applications. Since the problem has been proven to be NP hard in a strong sense, we …

Extending the concept of time-space networks, layered graphs associate information about
one or multiple resource state values with nodes and arcs. While integer programming …

We study the order acceptance and scheduling problem in a two-machine flowshop. The
firm receives a pool of orders before a planning period, each of which is characterized by …

The NP-hard single machine sequence-dependent group scheduling problem with
minimization of total weighted earliness and tardiness is investigated. An arc-time-indexed …

This paper presents a model for a dock assignment problem, where trailers need to be
assigned to gates for a given period of time for loading or unloading activities. The parking …

Working in an extended variable space allows one to develop tighter reformulations for
mixed integer programs. However, the size of the extended formulation grows rapidly too …