In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a collection of operations and there is a due da...

Quality control lead times are one of most significant causes of loss of time in the pharmaceutical and cosmetics industries. This is partly due to the organization of laboratories that feature parallel multipurpose machines for chromatographic analyses. The testing process requires long setup times and operators are needed to launch the process. The various controls are non-preemptive and are ...

The Apparent Tardiness Cost (ATC) heuristic is one of the best performing dispatch rules for the weighted tardiness scheduling problem. This heuristic uses a lookahead parameter whose value must be specified. In this paper we develop a function that maps some instance statistics into an appropriate value for the lookahead parameter. This function is compared with some fixed values that have bee...

Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of ...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm. KeywordsEarliness-tardiness scheduling, Polyn...

In many manufacturing systems, jobs that are completed early are held as finished-goods inventory until their due-dates, and hence we incur earliness costs. Similarly, jobs that are completed after their due-dates incur penalty. The objective in such situations would, therefore, be to meet the due-dates of the respective jobs as closely as possible, and consequently minimize the sum of earlines...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....

In this paper we study the resource-constrained project scheduling problem with weighted earliness-tardiness penalty costs. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness-tard...