We present a novel model for due date quotation. Jobs arrive at a single server over time. Upon arrival, the processing time of each job is known, and due dates must be quoted for each job. The jobs must be sequenced on the server so that all jobs complete processing at or before their due dates, and the sum of quoted due dates is minimized. We develop several variations of an on-line heuristic...

We consider the single-machine problem of scheduling n jobs to minimize the total weighted deviation from a given common due date, where the weights for early and tardy completion are asymmetric. First, we assume that the common due date is large. We formulate this problem as an integer linear program with an exponential number of variables and present a column generation algorithm to solve e c...

Project expediting is often viewed as a corrective action taken in response to prior scheduling errors and is usually applied in the later stages of projects when it appears that predefined due dates will not be met. However, large-scale projects with uncertain activity durations tend to have numerous probabilistic network paths with complex interactions that require some level of expediting to...

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...

To date, nonlinear l∞ -gain static output feedback control problems have not been solved by the conventional control methods for nonlinear discrete-time systems with persistent bounded disturbances. This study introduces static output feedback fuzzy control scheme to deal with the nonlinear l∞ -gain control problem. The structure of static output feedback fuzzy control is simpler than that of d...

WC consider the nonprccmptivc single machine scheduling problem with multiple due-dates (delivery dates). where the time between two consecutive due-dates is a constant. Given a set of jobs, we are interested in scheduling the jobs such that the sum of the total due-date cost and the total earliness cost is minimized with the constraint that each job must be finished at or before its due-date. ...

In this study we compare the cycle-time and on-time-delivery performance of the Critical Ratio (CR), the Earliest Due Date (EDD), and the Operation Due Date (ODD) dispatching rules in semiconductor wafer manufacturing. In addition, we comment on the robustness of the rules to low target flow factor values. It turns out that EDD has almost no positive effect on on-time delivery compared to First...

The input-queued switching architecture is becoming an attractive alternative for high speed switches owing to its scalability. Tremendous eeorts have been made to overcome the throughput problem caused by the contentions occurred at input and output sides of a switch. Existing input queueing algorithms mostly aim at improving through-put without considering QoS features. In this paper, a new a...

Yet, the few existing models considering learning effects in scheduling concentrate on learning-by-doing (autonomous learning). But recent contributions to the literature on learning in manufacturing organizations emphasize the important impact of proactive investments in technological knowledge on the learning rate (induced learning). In the present paper, we focus on a scheduling problem wher...