Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost pr...

In this paper we deal with a variant of the Job Shop Scheduling Problem. We consider the addition of release dates and deadlines to be met by all jobs. The objective is makespan minimization if there are no tardy jobs, and tardiness minimization otherwise. The problem is approached by using a Shifting Bottleneck strategy. The presence of deadlines motivates an iterative use of a particular one ...

So far the bottleneck of Chinese character recognition, especially handwritten character recognition, still lies in the effectiveness of featureextraction to cater for various distortions and position shifting. In ths paper, a novel method is proposed by applying a set of Gabor spatial filters with different directions and spatial frequencies to character images, in an effort to reach the optim...

So far the bottleneck of Chinese character recognition, especially handwritten character recognition, still lies in the effectiveness of featureextraction to cater for various distortions and position shifting. In ths paper, a novel method is proposed by applying a set of Gabor spatial filters with different directions and spatial frequencies to character images, in an effort to reach the optim...

This paper describes a population-based approach that uses a honey bees foraging model to solve job shop scheduling problems. The algorithm applies an efficient neighborhood structure to search for feasible solutions and iteratively improve on prior solutions. The initial solutions are generated using a set of priority dispatching rules. Experimental results comparing the proposed honey bee col...

A lossless large-volume data hiding method based on histogram shifting is proposed. The method is based on a scheme of hierarchically dividing a cover image into smaller blocks for data embedding using the histogram shifting technique, which yields a large data hiding capacity and results in a high stego-image quality. A technique for recursive looking-ahead estimation of the maximum data hidin...