This paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness. The scheduling problem of minimizing the total weighted tardiness with a common due date on a single machine is known to be ordinary NP-hard. This is also the case for problem Pm|di = d| ∑ wiTi. A new dynamic...

We consider the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012),...

In this paper, metaheuristic approaches for the two-machine flow shop problem with a common due date and the weighted late work performance measure (F2|dj=d|Yw) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Since, the problem mentio...

Scheduling problems involving both earliness and tardiness costs became more important in recent years. This kind of problems include both earliness and tardiness penalties and tries to reduce them. In this study a case study from real world is investigated. Since the machine is bottle neck in the production line and all jobs have a common restrictive due date and different earliness and tardin...

This study addresses a class of single-machine scheduling problems involving a common due date where the objective is to minimize the total job earliness and tardiness penalties. A genetic algorithm (GA) approach and a simulated annealing (SA) approach utilizing a greedy local search and three well-known properties in the area of common due date scheduling are developed. The developed algorithm...

We present a novel model for due date quotation. Jobs arrive at a single server over time. Upon arrival, the processing time of each job is known, and due dates must be quoted for each job. The jobs must be sequenced on the server so that all jobs complete processing at or before their due dates, and the sum of quoted due dates is minimized. We develop several variations of an on-line heuristic...

Project expediting is often viewed as a corrective action taken in response to prior scheduling errors and is usually applied in the later stages of projects when it appears that predefined due dates will not be met. However, large-scale projects with uncertain activity durations tend to have numerous probabilistic network paths with complex interactions that require some level of expediting to...

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...

WC consider the nonprccmptivc single machine scheduling problem with multiple due-dates (delivery dates). where the time between two consecutive due-dates is a constant. Given a set of jobs, we are interested in scheduling the jobs such that the sum of the total due-date cost and the total earliness cost is minimized with the constraint that each job must be finished at or before its due-date. ...