The single machine early/tardy problem
Management Science
Sequencing with earliness and tardiness penalties: a review
Operations Research
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
Computers and Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
Operations Research
The harpy speech recognition system.
The harpy speech recognition system.
The argos image understanding system.
The argos image understanding system.
Improved heuristics for the early/tardy scheduling problem with no idle time
Computers and Operations Research
Computers and Industrial Engineering
Computers and Industrial Engineering
Exact resolution of the one-machine sequencing problem with no machine idle time
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
| Hi-index | 0.00 |
In this paper, we present beam search heuristics for the single machine early/tardy scheduling problem with job-independent penalties, and no machine idle time. These heuristics include priority and detailed classic beam search algorithms, as well as filtered and recovering procedures. Three dispatching rules are considered as evaluation functions, in order to analyse the effect of different rules on the performance of the beam search heuristics. The computational results show that the performance of the beam search procedures does improve with the quality of the dispatching rule. The detailed and recovering algorithms clearly outperform the best existing heuristic, and the improvement is particularly higher for the more difficult instances. The detailed beam search algorithm provides the best performance, and is recommended for small to medium size instances. For larger instances, however, this algorithm requires excessive computation times. The recovering beam search procedure is computationally more efficient, and is then the heuristic of choice for medium to large instances.