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 …

In this paper, we consider a parallel-batch machine scheduling (PBMS) model that unifies
several existing scheduling models in the extant literature. In our scheduling model, a given …

In this paper, we introduce a graph multi-coloring problem where each vertex must be
assigned a given number of different colors, represented as integers, and no two adjacent …

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 study a scheduling problem with rejection on a single serial batching machine, where
the objectives are to minimize the total completion time and the total rejection cost. We …

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 …

This paper studies the bounded parallel-batching scheduling problem considering job
rejection, deteriorating jobs, setup time, and non-identical job sizes. Each job will be either …

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 …