Viewing scheduling as an opportunistic problem-solving process
Annals of Operations Research
The single machine early/tardy problem
Management Science
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
Computers and Operations Research
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
Improved heuristics for the early/tardy scheduling problem with no idle time
Computers and Operations Research
Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Pruning state spaces with extended beam search
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
On solving the assembly line worker assignment and balancing problem via beam search
Computers and Operations Research
Problem of assignment cells to switches in a cellular mobile network via Beam search method
WSEAS TRANSACTIONS on COMMUNICATIONS
Towards informed swarm verification
NFM'11 Proceedings of the Third international conference on NASA Formal methods
The activity-based aggregate production planning with capacity expansion in manufacturing systems
Computers and Industrial Engineering
A new inter-island genetic operator for optimization problems with block properties
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Hi-index | 0.00 |
In this paper, we present filtered and recovering beam search algorithms for the single machine earliness/tardiness scheduling problem with no idle time, and compare them with existing neighbourhood search and dispatch rule heuristics. Filtering procedures using both priority evaluation functions and problem-specific properties have been considered. The computational results show that the recovering beam search algorithms outperform their filtered counterparts, while the priority-based filtering procedure proves superior to the rules-based alternative. The best solutions are given by the neighbourhood search algorithm, but this procedure is computationally intensive and can only be applied to small or medium size instances. The recovering beam search heuristic provides results that are close in solution quality and is significantly faster, so it can be used to solve even large problems.