摘要:

This paper describes the effectiveness of a three-dimensional palletizing heuristic developed by the authors. It is shown that more boxes per unit time can be loaded with multi-pallet packing through reduction of non-productive movements of the robot to and from box storage areas. The use of the developed heuristic has been evaluated using a minalure robotic palletizing cell.

ISSN:0020-7543    

DOI:10.1080/00207549408956993

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor

摘要:

The kanban production authorization system has been widely implemented as a control scheme for just-in-time manufacturing. This system is normally applied in systems with reliable processes, low setup times, static demand and excess capacity. The use of kanbans avoids the need for complex information and hierarchical control systems on the shop floor. Kanban control also has the advantage of reacting quickly to minor demand changes. In this paper we investigate the use of kanban control at workcentres which produce multiple items with dynamic, random demand. The dynamic aspects of demand may cause temporary capacity shortages. The kanban control system automatically reacts quickly to the random aspects of demand. Selection of the number of kanbans will accommodate the dynamic aspect. We assume an environment with low setup times and a desire for rapid adjustment in production rates to match demand. A mathematical model for the problem is defined and shown to reduce to a simpler problem. Using the simpler problem, we investigate necessary and sufficient conditions for feasibility of the problem and specific choices of kanban levels. These conditions are used to define upper and lower bounds on the optimal number of kanbans which, in turn, are employed for developing optimal and near-optimal, heuristic algorithms for selecting kanban levels for each item. An algorithm is also derived for finding feasible production schedules given a feasible set of kanbans. The algorithm provides a policy which is easily implemented on the shop floor for guiding production decisions when capacity is limited. The methodology is illustrated with an example and results of experimental testing of the algorithm and heuristic are presented.

ISSN:0020-7543    

DOI:10.1080/00207549408956994

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor

摘要:

Cellular manufacturing is a viable option in many manufacturing systems. There are various subproblems in the design of a cellular manufacturing system. These are machine group and part family formation, machine duplication, intracell layout and intercell layout. The only comprehensive design strategy that attempts to address all of these is production flow analysis. However, this technique is a sequential strategy where the subproblems mentioned above are assumed nested within each other and are solved in a forward pass with no feedback. This is a satisfactory approach only in cases where the part families are relatively disjoint and machine groups are formed without constraints on machine duplication to eliminate intercell flow. The presence of bottleneck machines and parts renders the problem considerably more complex, as the subproblems influence each other substantially. This paper presents an integrated framework for solving these subproblems by generating a limited set of feasible alternative solutions.

ISSN:0020-7543    

DOI:10.1080/00207549408956995

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor

摘要:

Here a paced automobile assembly line is considered with no buffers between stations. Setup costs are incurred each time sequence of jobs switches colour in the paint shop, and utility work costs are incurred when some amount of work on a job cannot be completed within the boundary of a trim station. Although there has been a concerted effort to reduce setup costs, the nature of the changeovers makes it difficult to reduce to zero. Thus, there is a need for procedures that systematically consider both setup and utility costs, not only to improve current operations, but also to evaluate the economic benefit of investments in setup cost reduction. First, an algorithm with a look-ahead provision is developed to determine sequences for trim stations only. Later, setup cost is included and solution approaches are developed based on the previous algorithm. Extensive empirical study is done by using real as well as random data to evaluate performances of procedures.

ISSN:0020-7543    

DOI:10.1080/00207549408956996

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor

ISSN:0020-7543    

DOI:10.1080/00207549408956997

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor

ISSN:0020-7543    

DOI:10.1080/00207549408956397

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor