This paper considers a single-machine scheduling problem in which penalities occur when a job is completed early or late. The objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions for jobs. A procedure is presented for finding an optimal schedule.

We evaluate operations management–related journals based on a novel indicator of journal quality—the Author Affiliation Index (AAI). We explain the basic rationale behind the AAI, as well as its advantages and disadvantages with respect to other such indicators of journal quality. We provide a specific recipe for its calculation and apply it to 27 journals in which researchers in the field of operations management might wish to publish. We compare the resulting journal rankings to those from published survey reports and citation analyses and test AAI for sensitivity to its inputs. We find the rankings from AAI to be consistent with other studies and to be robust with respect to changes in inputs.

In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the extant literature on IIT scheduling, and identify areas of opportunity for future research.

EXECUTIVE SUMMARYThis paper introduces a new dispatching rule to job shop scheduling, extending earlier results to a multi-machine environment.