Showing papers in "Journal of Operations Management in 1984"

TL;DR: In this paper, a study of eight different rules for specifying due dates in a job shop and the evaluation of their performance was performed with a series of tests with a computer simulation model utilizing three different dispatching rules.

TL;DR: There are several techniques developed to form a traditional job shop into a cellular manufacturing system as mentioned in this paper, but these techniques have not been developed for easy industrial application and in many cases do not have a strong enough analytical base to warrant implementation.

TL;DR: It is found that the ATO philosophy requires special system design considerations, particularly in the areas of master scheduling, bills of material structuring, order entry/order promising, final assembly scheduling, and buffering against demand uncertainty.

TL;DR: In this paper, the authors present a survey of 57 users, 38 suppliers, and 64 experts on the challenges and benefits of using computer-aided manufacturing technologies in manufacturing processes.

TL;DR: Simulation experiments confirm that modified due-date priorities perform more effectively than other basic priority rules when performance is measured by average tardiness, and provide a warning that input control can be counterproductive.

TL;DR: Group technology (GT) is an innovative approach to batch production which seeks to rationalize a variety of aspects of the conversion process by recognizing and exploiting the underlying sameness which exists among component parts, end items, raw materials and so forth as discussed by the authors.

TL;DR: In this paper, the impact of a statistical scheduling technique on two classes of idle times in hospital operating suites was explored, and a mathematical model designed to minimize a weighted sum of the two types of idle time was constructed and optimized.

TL;DR: A heuristic procedure is presented here for scheduling large projects subject to the availability of all necessary resources, including materials, manufactured components, facilities, equipment and labor as well as the acquisition lead times required by these resources.

TL;DR: This study addresses the issue of planning horizons for companies employing a make-to-stock competitive strategy facing a seasonal demand for their products, and formulate the aggregate planning problem and the master scheduling problem as two separate mathematical programs to approximate the two-stage process that typically takes place in practice.

TL;DR: A simulation model of a multi-stage (fabrication and assembly) process is used to characterize the behavior of the three resolution methods when errors are present in the demand and time standard estimates.

TL;DR: In this paper, the authors describe a system for the automatic scheduling of employees in the particular setting in which: the number of employees wanted on duty throughout the week fluctuates; the availabilities of the employees varies and changes from week to week; and a new schedule must be produced each week, by virtue of the changing demand for service.

TL;DR: In this article, a framework of analysis to handle the problem of process yield losses in high-technology precision casting and integrated circuit production is established, and four key strategies developed are: 1. A: For continuous schedules, make-for-stock: Use mean yield rate and fixed buffer stocks.

TL;DR: In this paper, a methodology for designing approximately minimum cost assembly lines under conditions of random task times and off-line repair of incompleted tasks is described, where the goal is to assign tasks to work stations in such a way as to minimize total variable production costs.

TL;DR: It was found that gross requirements tend to occur sporadically in different levels of the system, and those rules that generate fewer orders over the planning horizon for parent nodes often tend to perform better on the basis of total inventory cost.

TL;DR: In this article, the authors developed two models of different complexity for determining if stock levels are economically unjustifiable and, if so, for determining inventory retention levels, which can be depicted mathematically as a parabolic function of the time supply retained.

TL;DR: A mixed integer linear programming model is proposed to determine which of a finite set of warehouse sites will be operating in each time period ofA finite planning horizon to reflect a number of acquisition alternatives—purchase, lease or rent.

TL;DR: The DISPLAN methodology as discussed by the authors is a heuristic procedure that uses the 3-dimensional transportation algorithm of linear programming in an iterative fashion to converge on the minimum cost network configuration subject to facility capacity and customer service constraints.

TL;DR: Two heuristics for solving the deterministic, single operator, multiple machine, multiple run, cyclic scheduling problem are presented, which are polynomially bounded, easily implemented on a mini- or micro-computer and in practice should be much faster than integer programming methods.

TL;DR: A model is developed to determine the optimal repairable parts inventory for a maintenance center servicing machines containing a single m-out-of-n system, and this model is extended to handle a related problem, finding optimal maintenance center inventories for machines containing several m- out- of-n systems of different parts, minimizing total expected costs subject to a constraint on total inventory investment.

TL;DR: In this paper, the authors evaluated two heuristic aggregate planning models in three types of health care food production systems to determine if the models were more effective in cost reduction than the management decisions which were made.

TL;DR: A method by which the process time for each of the various steps in a recipe may be computed as a function of the number of servings being prepared, which provides a great deal of flexibility to the decision maker for handling the type of scheduling problems commonly found in practice.

TL;DR: In this article, the authors investigated the factors that affect the efficiency and effectiveness of decentralized resource reallocation schemes in an industry-wide computer system, which enables common carriers to reduce empty or partially loaded mileage.

TL;DR: In this article, the effects of multiple shifts on production scheduling of assembly lines in heavy industry are analyzed and the major conclusion is that management should consider parallel line configuration whenever a synchronization problem exists and causes difficulties in production control as well as reduction in the learning effect.

TL;DR: In this article, the authors investigated a production planning problem faced by one of the largest companies in the steel industry, where they constructed a continuous caster capable of producing slabs of steel from 92 to 104 inches wide.

TL;DR: A simple, straight forward method for making the analysis in an MRP environment of product structure to determine whether subassemblies should be made to stock or combined offers the possibility of substantial cost savings.

TL;DR: This paper considers the more general case of scheduling n independent jobs on m unequal processors to minimize total tardiness, and develops a heuristic algorithm to solve the multiple-processor problem.

TL;DR: In this paper, a survey instrument was designed to assess worker attitudes in five areas believed to be related to the problem of time utilization: communication, organizational rewards, job scheduling, supervision, and job satisfaction.

TL;DR: The heuristic procedure described can be used to solve both the uncapacitated and the capacitated problems where capacity is expressed in terms of the number of activities which can be supported by the facilities.