Dynamic priority dispatching rules in job shops require the computation of all job priorities in a work center queue every time a machine in the work center becomes idle. This is extremely costly. Alternative priority update procedures are studied and comparative results in terms of performance...

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...

This paper addresses a nonpreemptive single machine scheduling problem where all jobs have a common due date and have zero ready time. The scheduling objective is to minimize mean squared deviation (MSD) of job completion times about the due date. This nonregular measure of performance is...

This paper considers a bicriterion scheduling problem where a linear combination of two objective functions is considered, with weighting factors used to represent relative importance of the two criteria, i.e., total flowtime and range of lateness. A branch-and-bound solution procedure is...

In production scheduling, time performance is usually taken to be the province of sequencing models which take task processing times to be given. However, in practice, processing times can often be controlled by the choice of lot sizes which thus have a major impact on makespan, waiting times,...

A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.

Problem definition: We study customer-centric privacy management in service systems and explore the consequences of extended control over personal information by customers in such systems.Methodology: We adopt a stylized queueing model to capture a service environment that features a service...

In many cities, a substantial fraction of calls for police service require more than one patrol car. We compare Green's multiple dispatch queueing model to several M/M/c-based approximations for multiple car dispatching that are obtained by adjusting the parameters. We found that none of the...

One of the primary concerns of urban police departments is the effective use of patrol cars. In large cities, police assigned to patrol cars typically account for more than 50% of total police manpower and their allocation has become particularly crucial in light of recent fiscal cutbacks. The...