Viewing scheduling as an opportunistic problem-solving process
Annals of Operations Research
The single machine early/tardy problem
Management Science
The harpy speech recognition system.
The harpy speech recognition system.
The argos image understanding system.
The argos image understanding system.
Constraint-directed search: a case study of job-shop scheduling
Constraint-directed search: a case study of job-shop scheduling
Scheduling Algorithms
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
Computers and Industrial Engineering
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
Computers and Operations Research
Computers and Operations Research
Beam search algorithm for capacity allocation problem in flexible manufacturing systems
Computers and Industrial Engineering
Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Journal of Intelligent Manufacturing
Computers and Operations Research
Computers and Operations Research
Computers and Operations Research
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Computers and Operations Research
Hi-index | 0.01 |
In this paper, we consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. 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. Previous beam search implementations use fixed beam and filter widths. We consider the usual fixed width algorithms, and develop new versions that use variable beam and filter widths. The computational results show that the beam search versions with a variable width are marginally superior to their fixed value counterparts, even when a lower average number of beam and filter nodes is used. The best results are given by the recovering beam search algorithms. For large problems, however, these procedures require excessive computation times. The priority beam search algorithms are much faster, and can therefore be used for the largest instances. Scope and purpose: We consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. In the current competitive environment, it is important that companies meet the shipping dates, as failure to do so can result in a significant loss of goodwill. The weighted tardiness criterion is a standard way of measuring compliance with the due dates. Also, the importance of sequence-dependent setups in practical applications has been established in several studies. In this paper, we present several heuristics based on the beam search technique. In previous beam search implementations, fixed beam and filter widths have been used. We consider the usual fixed width algorithms, and also develop new versions with variable beam and filter widths. The computational tests show that the beam search versions with a variable width are marginally superior to their fixed value counterparts. The recovering beam search procedures are the heuristic of choice for small and medium size instances, but require excessive computation times for large problems. The priority beam search algorithm is the fastest of the beam search heuristics, and can be used for the largest instances.