We consider the problem of common due-date to of simultaneously available jobs and sequencing them on a that a number of the jobs are tardy. The optimal combination of the common due-date and job sequence that minimizes the total absolute lateness. A simple to achieve this. Effectively three independent procedures : one to the nnT,nn<>1 sequence; a second to the optimal due date and a third to ...

We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classi®ed into three cases according to the value of maximum allowable tardin...

This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...

Date palm seed (Phoenix dactylifera) (DPS) extract has been used worldwide in pharmaceutical agent due to its constituents. This study aimed to assess the effects of DPS extract as a dietary supplementation at on the body composition, lipid peroxidation and tissue quality of common carp (Cyprinus carpio) based on the total volatile nitrogen (TVN) test. Common carp juveniles weighing ca 32 g wer...

The single machine scheduling problem with a common due date and nonidentical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performanc...

To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ([Formula: see text]). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of schedul...

This paper considers a scheduling problem for a single burn-in oven in the semiconductor manufacturing industry where the oven is a batch processing machine with restricted capacity. The batch processing time is set by the longest processing time among those of all the jobs contained in the batch. All jobs are assumed to have the same due date. The objective is to minimize the sum of the absolu...

The time-indexed formulation [3, 6] is a well-known way to formulate a singlemachine scheduling problem as a mixed-integer scheduling problem (MIP). It is based on time discretization: time is divided into unary periods (or time slots). The main advantage of this integer program is that the linear relaxation is very good. However, as the number of time-points is pseudo-polynomial in the size of...