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 ...

The paper considers the problem of scheduling n jobs on a single machine to minimize the number of tardy jobs (or late jobs). Each job has a release date, a processing time and a due date. The general case with non-equal release dates and diierent due dates is considered. Various mixed-integer linear programming formulations are presented and discussed. A new polynomial solvable case is also in...

We introduce a natural but seemingly yet unstudied generalization of the problem scheduling jobs on single machine so as to minimize number tardy jobs. Our lies in simultaneously considering several instances at once. In particular, we have n clients over period m days, where each client has job with its own processing time and deadline per day. goal is provide schedule for that guaranteed thei...

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),...

Inserted idle time occurs when a machine is kept waiting deliberately for the arrival of a job that is still being processed on a preceding machine. A common assumption in most of the existing literature on flowshop scheduling is that inserted idle time is not allowed, and whenever there are jobs that are ready for processing on a given machine, that machine is not kept idle for any reason. Thi...

This paper addresses the job shop scheduling problem with minimizing the number of tardy jobs as the objective. This problem is usually treated as a job sequencing problem, and the permutation-based representation of solutions was commonly used in the existing search-based approaches. In this paper, the flaw of the permutation-based representation is discussed, and a rule-centric concept is pro...

We consider a single-machine scheduling problem in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off ...