Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs
Reads0
Chats0
TLDR
This paper considers the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time, and presents heuristic algorithms based on the beam search technique.Abstract:
In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Several dispatching rules are considered as evaluation functions, to analyze the effect of different rules on the effectiveness of the beam search algorithms. The computational results show that using better rules improves the performance of the beam search heuristics. The detailed, filtered beam search (FBS) and recovering beam search (RBS) procedures outperform the best existing heuristic. The best results are given by the recovering and detailed variants, which provide objective function values that are quite close to the optimum. For small to medium size instances, either of these procedures can be used. For larger instances, the detailed beam search (DBS) algorithm requires excessive computation times, and the RBS procedure then becomes the heuristic of choice.read more
Citations
More filters
Journal ArticleDOI
Biased random-key genetic algorithms for combinatorial optimization
TL;DR: This paper presents a tutorial on the implementation and use of biased random-key genetic algorithms for solving combinatorial optimization problems, illustrating the ease in which sequential and parallel heuristics based on biased Random-Key genetic algorithms can be developed.
Journal ArticleDOI
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
TL;DR: This paper considers a single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time, and proposes a genetic approach based on a random key alphabet that clearly outperform the existing heuristics, and are quite close to the optimum solutions.
Journal ArticleDOI
Heuristics for the single machine scheduling problem with early and quadratic tardy penalties
TL;DR: This paper considers the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time, and several dispatching heuristics are proposed, and their performance is analysed on a wide range of instances.
Journal ArticleDOI
A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness
TL;DR: This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness and proposes a genetic algorithm procedure that was consistently effective in generating good solutions.
Posted Content
The transition to IFRS: disclosures by Portuguese listed companies
TL;DR: In the context of the CESR and of the Portuguese market regulator recommendations regarding the disclosure of the impacts of the transition to IFRS, this paper analyzed the content of those disclosures by Portuguese listed companies and found that the objective of comparability, relevance and understandability stated in CESR's recommendation were not achieved.
References
More filters
Journal ArticleDOI
Sequencing with Earliness and Tardiness Penalties: A Review
Kenneth R. Baker,Gary D. Scudder +1 more
TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
Book
The HARPY speech recognition system
TL;DR: The HARPY system is the result of an attempt to understand the relative importance of various design choices of two earlier speech recognition systems developed at Carnegie-Mellon University, in which knowledge is represented as a finite state transition network but without the a-priori transition probabilities.
Journal ArticleDOI
Filtered beam search in scheduling
Peng Si Ow,Thomas E. Morton +1 more
TL;DR: In this article, the authors systematically study the performance behavior of beam search with other heuristic methods for scheduling, and the effects of using different evaluation functions to guide the search, and develop a new variation of beam searching, called filtered beam search, which is computationally simple yet produces high quality solutions.
Journal ArticleDOI
One-processor scheduling with symmetric earliness and tardiness penalties
TL;DR: It is shown that the problem of finding minimum cost schedules is NP-complete; however, an efficient algorithm is given that finds minimum cost scheduling whenever the tasks either all have the same length or are required to be executed in a given fixed sequence.
Journal ArticleDOI
The single machine early/tardy problem
Peng Si Ow,Thomas E. Morton +1 more
TL;DR: A variation of the Beam Search method, called Filtered Beam Search, is proposed, able to use priority functions to search a number of solution paths in parallel and was not only efficient but also consistent in providing near-optimal solutions with a relatively small search tree.