This paper describes a simulation study of assigning attainable or predictable due-dates in hypothetical labor and machine constrained job shop settings of varying size and structure. Several predictable due-date assignment rules are developed based on conditional estimates of individual job...

This study explores the due-date performance of job shop control systems which base job due dates on a time-phased representation of the workload and the machine capacity in the shop. The performance is measured by the mean and the standard deviation of the lateness. Two parameters are used to...

We consider the problem of minimizing the expected makespan of n jobs with independent exponentially distributed processing times on two parallel machines, under resource constraints. Job j has expected processing time 1/\mu _j and requires throughout its processing an amount r_j of a resource; the...

Recent research studies of job shop scheduling have begun to examine the interaction between sequencing priorities and the method of assigning due-dates. This paper surveys the tactical aspects of this interaction, focusing primarily on average tardiness as a measure of scheduling effectiveness....

A collection of stochastic jobs is to be processed by a single machine in a manner which is consistent with a precedence relation on the job set. Costs are incurred as jobs are processed and rewards are earned when they complete. The problem of finding optimal processing strategies is in general...

In this paper we consider a class of job shops with a dispatch area and a machine shop, where operational controls are exercised at the dispatch area as well as at the machine shop. For such dynamic job shops with these two levels of control, there are three categories of models. They are (1)...

We consider the problem of smoothing production in a job shop in which all production is to customer order and the demand process is a stationary stochastic process. We present an approach to production smoothing based on the concept of a planning window. A planning window is the difference...

In 1973, Balut gave an algorithm to solve an n-job one machine scheduling problem in which processing times are random variables and the objective is to minimize the number of tardy jobs with a specified certainty level. This note, however, presents an example for which his algorithm fails to...

Improved priority scheduling rules are presented for a repair shop supporting a multi-item repairable inventory system with a hierarchical product structure. A variety of scheduling rules are evaluated using a simulation of a representative shop and product structure. The results indicate that...

This paper is concerned with the study of the constant due-date assignment policy in a dynamic job shop. Assuming that production times are randomly distributed, each job has a penalty cost that is some non-linear function of its due-date and its actual completion time. The due date is found by...