The problem of short-term scheduling often involves the satisfaction of variable product demands at specific due dates within the time horizon under consideration. Ierapetritou and Floudas (Ind. Eng. Chem. Res. 1998, 37, 4341-4359, 4360-4374) presented a new continuous time formulation to effectively address the problem of short-term scheduling in batch, continuous, and mixed production facilit...

Abstract We study two $$\mathcal {NP}$$ NP -hard single-machine scheduling problems with generalized due-dates. In such problems, due-dates are associated positions in the job sequence rather than jobs. Accordingly, that is assigned to position j processing order (job sequence), a predefined due-date, $$\delt...

We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...

The just-in-time concept in manufacturing has aroused interest in machine scheduling problems with earliness-tardiness penalties. In particular, common due date problems, which are structurally less complicated than problems with general due dates, have emerged as an interesting and proliic eld of research. We prove that so-called almost common due date problems, in which the due date d j and p...