In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with … construction. The proposed heuristics were compared with existing procedures, as well as with optimum solutions for some instance …

heuristics include simple and widely used scheduling rules, as well as adaptations of those rules to a quadratic objective …In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no … machine idle time. We propose several dispatching heuristics, and analyse their performance on a wide range of instances. The …

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two … new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both … solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics …

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present … search and dispatch rule heuristics. Filtering procedures using both priority evaluation functions and problem …

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no … filtered and recovering beam search heuristics. Extensive preliminary tests were performed to determine appropriate values for …

In this paper, we present a hybrid genetic algorithm for a version of the early/tardy scheduling problem in which no …

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no … an appropriate value for this parameter. The use of dominance rules to improve the solutions obtained by these heuristics … performance for the early/tardy scheduling problem with release dates and no unforced idle time. …