We consider the problem of scheduling n jobs to minimize the total earliness and tardiness penalty. We review the literature on this topic, providing a framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date. To this base we add such features as parallel machines, complex penalty functions and distinct due dates. We also consolidate many of the existing results by proving general forms of two key properties of earliness/tardiness models.

No abstract

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. The discussion highlights several factors that can affect the performance of dispatching rules, such as the average flow allowance, the due-date assignment method, and the use of progress milestones. A set of simulation experiments illuminates how these factors interact with the dispatching rule, and the experimental results suggest which combinations are most effective in a scheduling system.production/scheduling: job shop, stochastic, inventory/production: policies, leadtime, simulation: application

We examine the effects of component commonality on optimal safety stock levels in a two-product, two-level inventory model. The criterion is to minimize system safety stock subject to a service level constraint. Although our model is specialized, its analysis provides insights not available in other multilevel inventory models.inventory/production, measures of effectiveness, multi-echelon

Economies of scale are fundamental to manufacturing operations. With respect to scheduling, this phenomenon manifests itself in efficiencies gained from grouping similar jobs together. This paper reviews the rapidly growing literature on single-machine scheduling models that incorporate benefits from job grouping. We focus on three basic models known as family scheduling with item availability, family scheduling with batch availability, and batch processing. We present known results and introduce new results, and we pay special attention to key theoretical properties and the use of these properties in optimization procedures.