Over the past 20 years, the topic of order acceptance has attracted considerable attention
from those who study scheduling and those who practice it. In a firm that strives to align its …

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 consider in this work a bicriteria scheduling problem on two different parallel machines
with a periodic preventive maintenance policy. The two objectives considered involve …

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 set of scheduling problems on a uniform machine setting. We focus on the case
of equal processing time jobs with the additional feature of job rejection. Jobs can either be …

Scheduling with rejection is a representative and applied scheduling that emerged around
2000. It is one of the generalizations of the classical scheduling problems. In classical …

In this paper, we consider the single machine scheduling with job rejection and generalized
the number of rejected jobs. More specifically, each job is either accepted and processed on …

We consider a bicriteria scheduling problem on two parallel, non identical machines with a
periodic preventive maintenance policy. The two objectives considered involve minimization …

Production scheduling is considered as one of the most important tasks carried out in
manufacturing systems. It allows available resources to perform a number of tasks, over a …