In classical deterministic scheduling problems, it is assumed that all jobs have to be
processed. However, in many practical cases, mostly in highly loaded make-to-order …

We study the classical scheduling problem of minimizing makespan on a proportionate
flowshop. Position-dependent job processing times in the most general way are considered …

Single machine scheduling problems have been extensively studied in the literature under
the assumption that all jobs have to be processed. However, in many practical cases, one …

We consider a version of parallel machine scheduling with rejection. An instance of the
problem is given by m identical parallel machines and a set of n independent jobs, with each …

This paper addresses the hybrid flow shop scheduling problem by considering job rejection
to minimize the sum of the total tardiness cost of the scheduled jobs and total cost of the …

We study a scheduling problem with rejection on a set of two machines in a flow-shop
scheduling system. We evaluate the quality of a solution by two criteria: the first is the …

Scheduling has become a popular area for artificial intelligence and expert system
researchers during last decade. In this paper, a new metaheuristic algorithm entitled …

In the parallel batch scheduling model, a group of jobs can be scheduled together as a
batch while the processing time of this batch is the greatest processing time among its …

In many heavily loaded manufacturing systems, managers routinely make use of
outsourcing options in order to maintain reasonable Quality of Service for customers. Thus …

In this paper, we try to fill in the gap between theory and practice in production scheduling by
defining a new term as “rejection” and treating the corresponding scheduling problem with …