In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs ….The computational results show that using better rules improves the performance of the beam search heuristics. The detailed, filtered … (DBS) algorithm requires excessive computation times, and the RBS procedure then becomes the heuristic of choice. …

, preventive maintenance is required. In this paper we discuss the Preventive Maintenance Scheduling Problem (PMSP), where (short … mathematical formulation for this problem and some greedy heuristics to solve it fast. Moreover, we compare the performance of … these heuristics with the optimal solution using some randomly generated instances. …

For the basic problem of non-preemptively scheduling n independent jobs on m identical parallel machines so that the …-known longest-first heuristics - the LPT- (longest processing time) and the RLPT-heuristic (restricted LPT). We provide insights … into the solution structure of these two sequencing heuristics and prove that the minimum completion time of the LPT …

scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates …In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine …

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and … tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and … recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of …

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs … computational results show that using better rules indeed improves the performance of the beam search heuristics. The detailed … algorithm requires excessive computation times, and the recovering beam search procedure then becomes the heuristic of choice. …

instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of these …In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs …, and no machine idle time. We propose several dispatching heuristics, and analyse their performance on a wide range of …

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 … neighbourhood search algorithm, but this procedure is computationally intensive and can therefore only be applied to small or medium …

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 … the parameters used by each algorithm. The computational results show that the recovering beam search algorithms …