This paper addresses the problem of scheduling economic lots in a multi-product single machine environment. A mixed … models backorders. To solve the problem we develop a hybrid approach, combining a genetic algorithm and linear programming …

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower …-and-bound algorithm, and the computational tests show that one of the new lower bounds has the best performance for larger instances. …

scheduling problem with no idle time. We also propose an improvement algorithm that uses these conditions and can be applied to … improve the sequence given by a heuristic procedure. This algorithm can be used to improve not only upper bounds for the … weighted earliness criterion, but also lower bounds for the earliness/tardiness scheduling problem. The computational tests …

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no … performance for the early/tardy scheduling problem with release dates and no unforced idle time. …

In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no … heuristics include simple and widely used scheduling rules, as well as adaptations of those rules to a quadratic objective …

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and … procedures clearly outperform the best existing heuristic. The detailed beam search algorithm performs quite well, and is …, and the recovering beam search algorithm then becomes the heuristic of choice. …

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 … algorithm requires excessive computation times, and the recovering beam search procedure then becomes the heuristic of choice. …

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 …