In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower …

scheduling problem with no idle time. We also propose an improvement algorithm that uses these conditions and can be applied to … weighted earliness criterion, but also lower bounds for the earliness/tardiness scheduling problem. The computational tests …

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and …

In this paper, we consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. We …

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs …

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs … instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of these …

scheduling problem. This heuristic uses a lookahead parameter whose value must be specified. In this paper we develop a function …

In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no …

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two …

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs …