We study single machine scheduling problems with the following features:(i) Generalized
due-dates are considered, ie, the j-th due-date is assigned to the j-th completed job;(ii) A …

We consider a single-machine scheduling problem with generalized and periodic due dates
such that each due date is assigned not to a specific job but to a position and the lengths of …

We consider scheduling problems such that the due date is assigned to a job, depending on
its position, and the intervals between consecutive due dates are identical. The objective is …

We consider a single-machine scheduling problem such that the due dates are assigned to
each job depending on its order, and the lengths of the intervals between consecutive due …

We consider a two-machine flow shop scheduling with two properties. The first is that each
due date is assigned for a specific position different from the traditional definition of due …

We consider a single-machine scheduling problem such that the due date is assigned not to
a specific job, but to a job position, with identical intervals between consecutive due dates …

In the paper, we consider novel scheduling problems under singlemachine, parallel-
machine and two-machine open-shop environment. The due date is assigned to a job …

We consider a single‐machine scheduling problem with outsourcing options in an
environment where the cost information of the downstream is available via some information …

We consider a scheduling problem on identical machines in parallel such that the due date
is assigned not to the specific job, but to the job position. Each processing time can be …

We consider two just-in-time scheduling problems in a single-machine environment, where
the due dates are not job-dependent but position-dependent. A job can be rejected or …