Results 1  10
of
10,621
Minimizing the Number of Tardy Jobs with Gammadistributed Processing Times
"... Abstract—This paper investigates two scheduling problems i.e., single machine scheduling problem with minimizing the number of tardy jobs and two machine flow shop scheduling problem with a common due date and minimizing the number of tardy jobs, in a stochastic setting in the class of nonpreemptiv ..."
Abstract
 Add to MetaCart
Abstract—This paper investigates two scheduling problems i.e., single machine scheduling problem with minimizing the number of tardy jobs and two machine flow shop scheduling problem with a common due date and minimizing the number of tardy jobs, in a stochastic setting in the class of non
Bicriteria scheduling problems: number of tardy jobs and maximum weighted tardiness
 European Journal of Operational Research ,Vol.177,No.1,pp
"... Consider a single machine and a set of jobs that are available for processing at time 0. Job has a processing time, a due date and a weight. We consider bicriteria scheduling problems involving the maximum weighted tardiness and the number of tardy jobs. We give NPhardness proofs for the scheduling ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Consider a single machine and a set of jobs that are available for processing at time 0. Job has a processing time, a due date and a weight. We consider bicriteria scheduling problems involving the maximum weighted tardiness and the number of tardy jobs. We give NPhardness proofs
Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times
 ACTA CYBERNETICA
, 1998
"... This paper investigates a singlemachine sequencing problem where the jobs are divided into families, and where a setup time is incurred whenever there is a switch from a job in one family to a job in another family. This setup only depends on the family of the job next to come and hence is seque ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is sequence independent. The jobs are duedated, and the objective is to find a sequence of jobs that minimizes the number of tardy jobs. The special case of this problem where in every family the jobs have at most two different due dates is known to be NPcomplete [Bruno & Downey, 1978]. The main
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling
 Journal of Scheduling
, 1999
"... This 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 nonequal release dates and different due dates is considered. Using new and efficient l ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
This 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 nonequal release dates and different due dates is considered. Using new and efficient
Constraint Programming Search Procedure for Earliness/Tardiness Job Shop Scheduling Problem
"... 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 tardine ..."
Abstract
 Add to MetaCart
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
Single Machine Scheduling with Stochastic Processing Times or Stochastic DueDates to Minimize the Number of Early and Tardy Jobs
, 2005
"... AbstractWe study a single machine scheduling problem in which processing times or duedates are nonnegative independent random variables and random weights (or penalties) are imposed on both early and tardy jobs. The objective is to find an optimal sequence that minimizes the expected total weighte ..."
Abstract
 Add to MetaCart
AbstractWe study a single machine scheduling problem in which processing times or duedates are nonnegative independent random variables and random weights (or penalties) are imposed on both early and tardy jobs. The objective is to find an optimal sequence that minimizes the expected total
Surrogate Objective based Search Heuristics to Minimize the Number of Tardy Jobs for MultiStage Hybrid Flow Shop Scheduling
"... This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine the all ..."
Abstract
 Add to MetaCart
This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine
1 New Solution Methods for Single Machine Bicriteria Scheduling Problem: Minimization of Average Flowtime and Number of Tardy Jobs
"... We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NPhard, is important in practice, as the former criterion conveys the customer’s position, and the latter reflects the manufacturer’s per ..."
Abstract
 Add to MetaCart
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NPhard, is important in practice, as the former criterion conveys the customer’s position, and the latter reflects the manufacturer’s
Results 1  10
of
10,621