We address resource leveling problems in a machine environment. Given a set of m machines, one or more renewable resources, and a set of n tasks, each assigned to exactly one of the machines. Each task has a processing time, an earliest start time, a deadline, and resource requirements. There...

Recent literature on supply chain coordination offers a wide range of game theoretic and optimization approaches that ensure efficient planning in the supply chain, but assume that the involved parties have complete information about each other. However, in reality, complete information is...

The principal challenge of inventory control in supply chains is that the interacting autonomous enterprises have to plan their production and logistics under information asymmetry, driven by different, often conflicting objectives. In this paper, four different computational approaches are...

In this paper we propose exact solution methods for a bilevel uncapacitated lot-sizing problem with backlogs. This is an extension of the classical uncapacitated lot-sizing problem with backlogs, in which two autonomous and self-interested decision makers constitute a two-echelon supply chain....

In this paper we present a case study from the lighting industry concerned with the scheduling of a set of job families each representing the production of a particular end-item in a given quantity. It is a job shop type problem, where each job family has a number of routing alternatives, and...