In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family. 2007 Elsevier Ltd. All rights reserved.

Advanced Planning and Scheduling systems (APS) are intensively utilized in the industry, namely because they allow generating and analyzing planning scenarios very quickly. They are not well suited for make-to-order situations since due dates are not considered hard constraints to be fulfilled. Processing time windows allow to take into account due dates in the development of APS enhanced heuri...

We develop an O (q2n + nlogn) algorithm to obtain a preemptive schedule that minimizes maximum lateness when n jobs with given due dates and memory requirements are to be scheduled on m processors (n ≥ m) of given memory sizes. q is the number of distinct due dates. The value of the minimum maximum lateness can itself be found in O(qn + nlogn) time.

In this paper we look at the problem where we have to schedule n jobs with release dates, due dates, weights, and equal processing times on a single machine. The objective is to minimize the sum of weighted tardiness (1|rj , pj = p| ∑ wjTj in the threefield notation scheme). We formulate the problem as a time indexed ILP after which we solve the LP-relaxation. We show that for certain special c...

We consider a stochastic scheduling problem with impatience to the end of service or impatience to the beginning of service. The impatience of a job can be seen as a stochastic due date. Processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling polic...

In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. Although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the P-MMRCPSP while due dates are included i...

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a maketo-order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two-machine flow shop, consider several variation...

This study attempts to enhance the responsiveness of enterprises by adjusting the delivery dates taking into account of the production and delivery schedules in a supply chain. To enhance responsiveness, we suggest a due-date assignment method and re-negotiation process for a sales order processing system. The due-date assignment method is designed with the concept of categorized customers’ pri...

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a maketo-order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two-machine flow shop, consider several variation...