We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time. We describe dominance rules for these criteria, as well as techniques for using these dominance rules to build heuristic solutions. We use them to improve certain well-known greedy heuristic algorithms from the liter...

Symmetry-based state space pruning techniques have proved to greatly improve heuristic search based classical planners. Similarly, abstraction heuristics in general and pattern databases in particular are key ingredients of such planners. However, only little work has dealt with how the abstraction heuristics behave under symmetries. In this work, we investigate the symmetry properties of the p...

This paper compares implicit and explicit based segmentation techniques for off-line cursive handwriting recognition. Firstly, limitations in conventional implicit based approaches are handled by imposing sequence of heuristic rules to locate prospective segmentation points. However, fine segmentation delayed until character recognition. Additionally, for character hypothesis generation, forwar...

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient heuristic and search techniques. This paper proposes an efficient genetic algorithm for hybrid flow shop scheduling problems. The proposed algorithm is tested by Carli...

A refined heuristic for computing schedules for gossiping in the telephone model is presented. The heuristic is fast: for a network with n nodes and m edges, requiring R rounds for gossiping, the running time is O(R n log n m) for all tested classes of graphs. This moderate time consumption allows to compute gossiping schedules for networks with more than 10,000 PUs and 100,000 connections. The...

Flow shop scheduling of jobs has always been a popular problem that has found solutions in the number of heuristic and meta-heuristic techniques. In this manuscript, two-machine flow shop scheduling problem has been investigated while optimizing makespan and idle time of machines. Uncertainties in the processing time and set up times of jobs involved are also taken into consideration in the for...

Parallel machines concept is a well-known and widely used system in the manufacturing facilities. Scheduling of these parallel machines has been a key activity in the successful product outcome. Though jobs are executed on schedules, in certain cases the completion time increases resulting in tardiness. This survey work identifies and compiles the optimization strategies and solution approaches...

Several techniques have recently been developed that are based on discrepancy analysis in heuristic-based search trees. We offer a comparison of two of these proposed techniques: depth-bounded discrepancy search (DDS) and heuristic-biased stochastic sampling (HBSS), and one new technique, depth-scaled biased stochastic sampling (DSBSS). The new technique uses the framework of HBSS, but takes in...

While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause the algorithm to get stuck performing a lot of unnecessary work. In this report, we consider simple ...