We consider the problem of scheduling of n jobs to minimize the total earliness and tardiness penalty. The scheduling objective is to minimize the sum of job dependent earliness and tardiness penalties.. After determining the scheduling for single machine common due date, using neural network, the result shows that the neural network solution performs very well.

The objective of this paper is to propose a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system. Considering the due date of AGVs requiring for material handling among shops in a job shop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardine...

OBJECTIVE Triggered by the new federal commitment announced by the Office of National Drug Control Policy (ONCDP) to encourage states to enact drugged driving per se laws, this article reviews the reasons to establish such laws and the issues that may arise when trying to enforce them. METHODS A review of the state of drunk driving per se laws and their implications for drugged driving is pre...

The objective of this study was to select genitors based on F1 and F2 generations, evaluated in different environments, to obtain segregating populations for the identification of strains showing improved earliness, yield, and carioca-type grains. Nine bean strains were crossed in a partial diallel scheme (4 x 5), in which group 1 included 4 strains with early cycles and group 2 included 5 elit...

This paper describes a constraint programming approach to solving a scheduling problem with earliness and tardiness cost using a problem specific search procedure. The presented algorithm is tested on a set of randomly generated instances of the job shop scheduling problem with earliness and tardiness costs. The experiments are executed also for three other algorithms, and the results are then ...