The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

This paper deals with earliness and tardiness scheduling around common due dates and
windows. Related problems share a strong practical importance due to the endogenous and …

We aim at providing a unified framework of the common due date assignment and
scheduling problems in the deterministic case by surveying the literature concerning the …

Scheduling has become a major field within operational research with several hundred
publications appearing each year. This paper explores the historical development of the …

We derive results of the following flavor: If a combinatorial optimization problem can be
formulated via a dynamic program of a certain structure and if the involved cost and …

This paper focuses on the distributed concrete precast flow shop scheduling problem to
minimize total weighted earliness and tardiness. It is crucial for a precast manufacturer to …

In this chapter we consider the scheduling problems with minimization of the earliness and
tardiness costs, where all tasks should be completed at the same due date. Problems with …

We design a fully polynomial-time approximation scheme (FPTAS) for a knapsack problem
to minimize a symmetric quadratic function. We demonstrate how the designed FPTAS can …

We consider the parallel-machine scheduling problem in which the processing time of a job
is a simple linear increasing function of its starting time. The objective is to minimize the total …

In one-machine scheduling, mixed-integer program time-indexed formulations are often
used to provide very good lower bounds through Lagrangian relaxations. To get an …