We study single machine scheduling problems with generalized due-dates. The scheduling
measure is minimum total late work. We show that unlike the classical version (assuming job …

In this paper, we consider multiprocessor scheduling with submodular penalties to extend
multiprocessor scheduling with rejection to submodular function. An instance of the problem …

We study an order acceptance and scheduling problem with batch delivery in a supply chain
consisting of a manufacturer and a customer. The manufacturer can rejects some orders …

We study a scheduling problem on parallel identical machines, where the objective function
is maximizing the weighted number of jobs completed exactly at their due-dates. The …

We study a single machine scheduling problem, where the goal is to maximize the weighted
number of jobs completed exactly at their due-dates. The option of job-rejection is …

We study an order scheduling problem with rejection, in which each order consists of
multiple product types and each product type should be manufactured on a dedicated …

We study an integrated order acceptance and scheduling problem for heterogeneous
factories with carbon caps, order-dependent processing speeds, and setup times. Three …

We consider single machine lot scheduling problems. A number of customer orders of
different sizes may be processed in the same lot. Splitting orders between consecutive lots is …

We address single machine problems with optional job rejection, and focus on minimizing
regular performance measures, ie, functions that are non-decreasing in the jobs, completion …

In this paper, we consider the single machine scheduling problem with release dates and
nonmonotone submodular rejection penalty. We are given a single machine and multiple …