Because of activity duration uncertainties, large-scale projects can often be modeled most realistically as probabilistic activity networks. The complex interactions among activities with uncertain durations virtually assures a low probability that these projects will be completed before predetermined due dates. As a result, it is often necessary to expedite individual activities in these proje...

This paper deals with multiprocessor task scheduling with ready times, due dates and prespecified processor allocation. In the studied problem tasks are not initially all available in the scheduler and can be executed only by given ready times, respecting their due dates. Moreover, a task can be examined in order to be processed only when it enters the scheduler. The concept of rejection is int...

The following note develops theorems which enable one to schedule operations on a single-stage production system so a s to minimize certain functions o r optimizers. It is shown that the maximum tardiness of job completion is minimized by ordering the jobs according to the date the job is due to be completed. The sum of t imes until eachjob is completed may be minimized under various conditions...

We consider a project that consists of activities operating in parallel under various temporal constraints, including start-start, startfinish and finish-start precedence relations, early start, late start and late finish time boundaries, and due dates. Scheduling problems are formulated to find optimal schedules for the project under different optimality criteria to minimize, including the pro...

Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

  This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...

A case study of a cutting stock problem in an aluminium mill is presented. Orders have release dates, due dates, a total length and may be delivered in any number of coils within rather large length intervals. A variety of diierent cutting machines is available, hierarchical cuts may be necessary to produce small widths. The mill is capable of producing custom{made coils within certain bounds b...