摘要:

This paper describes how material requirements planning (MRP) can provide a working solution to job shop scheduling problems. In particular, the critical factors relating to resource and capacity management are examined within a low volume, make-to-order company. A rough cut capacity planning (RCCP) module is described which, when used with a detailed capacity management methodology, has enabled the collaborating company to achieve substantial savings in work-in-progress (WIP), a marked reduction in machining lead times and viable control over customer lead times. Finally, an MRP production methodology is described, which allows such concepts as unit cost justification and machine utilisation to be re-examined.

ISSN:0020-7543    

DOI:10.1080/00207548808947931

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

A two-stage procedure for the design of a cellular manufacturing system is proposed. The first stage forms the part families. The use of clustering techniques with a new proximity measure is advocated for this stage. The proximity measure uses the manufacturing operations and the operations' sequences. The second stage forms the machine cells. An integer programming model is proposed for this stage. The solution of this model will specify the type and the number of machines in each cell and the assignment of the part families to the cells. The relevance of this approach in the design of flexible manufacturing systems is discussed.

ISSN:0020-7543    

DOI:10.1080/00207548808947932

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

We have developed an event-driven algorithm for simulating a factory production line with storage. Using this algorithm a production line, with an arbitrary number of machines each processing items at different rates and with buffers of any size, can be modelled efficiently. The algorithm is based on computing the time to the next event for each buffer and machine, where the events are: a buffer becomes full, a buffer becomes empty, a machine fails and a machine is repaired. By collapsing the production line to exclude empty buffers that stay empty and full buffers that stay full, piece-by-piece computation is avoided. Computation time is reduced further by updating a buffer only when the input or output rate of that buffer changes or when the state of that buffer changes. The implementation of this model is compared to a piece-by-piece simulator.

ISSN:0020-7543    

DOI:10.1080/00207548808947933

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

A branch and bound procedure to solve thenjob,mparallel machine problem for the weighted flowtime criterion has been developed by Elmaghraby and Park (1974) and further modified by Barnes and Brennan (1977). This paper proposes a branching scheme different from theirs and shows its superiority. Also, some new and simple results are presented which are easy to implement to obtain an efficient branch-and-bound algorithm. In addition, a new and improved lower bound is developed which is easy to compute.

ISSN:0020-7543    

DOI:10.1080/00207548808947934

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

In the multistage job shop, several parts are assembled to form sub-assemblies which are then assembled into final products. Job delays may occur due to the lack of capacity and also due to the lack of component parts necessary to form a subassembly. Previous research of similar systems have assumed a balanced capacity. A more realistic assumption is one in which machine capacities are not balanced such that one machine can be identified as a bottleneck. In this paper, the performance of selected dispatching rules in an unbalanced multistage job shop is evaluated to-determine whether the performance is consistent for jobs which are routed through the bottleneck and for jobs which by-pass the bottleneck.

ISSN:0020-7543    

DOI:10.1080/00207548808947935

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

An integrated manufacturing system with a finite capacity consisting of a set of work stations, a loading station and unloading stations linked by a material handling system is considered. Each work station has a local storage, a set of flexible machines capable of processing workpieces belonging to the same family of parts and an unloading station. Each workpiece requires only one stage of operation which may receive it from either one of the work stations. The integrated material handling system consists of a set of line conveyors, each with a specified length, velocity and capacity. In this paper, an open queueing network model is developed to analyse the effects of the loading, the material handling, the storage and the processing operations on the asymptotic performance of the system. Furthermore, a methodology for controlling the congestion along the material handling system is suggested. Numerical results are also provided and the approximations results are compared against those from a simulation study.

ISSN:0020-7543    

DOI:10.1080/00207548808947936

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

In this paper a heuristic method is given for determining nearly optimal operating policy in joint replenishment inventory problems. The performance of the heuristic method is compared with some of the other known heuristic methods available for solving such problems.

ISSN:0020-7543    

DOI:10.1080/00207548808947937

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

Results are presented of experiments with a simulation model of an actual make-for-stock shop, in which both the scheduling and due-date updating decision rules were varied and the effect on a cost function observed. A marked interaction between the rules occurred in some cases. One of the due-date updating rules, which does not appear to have been used previously, had the effect of advancing or retarding the due date of a batch as it passed through the shop in response to the difference between the actual and expected demand for the product. This rule was found to perform well when used in combination with a due-date-based scheduling rule.

ISSN:0020-7543    

DOI:10.1080/00207548808947938

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

This paper describes the method of determining batch sizes in a multi-product, multi-stage situation and presents a Decision Support System (DSS) for capacity utilization. A heuristic model has been developed for modifying the optimal batch sizes in a manner such that machine hour and labour productivity constraints are not violated. The capacity utilization so determined will also suggest and identify the need for reduction of number of set-ups.

ISSN:0020-7543    

DOI:10.1080/00207548808947939

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

Many researchers solve scheduling problems with sequence dependent set-up times using a travelling salesman problem formulation. We show that this reduction may produce poor solutions when applied to the cyclic lot scheduling problem. We propose one approach that may remedy the situation.

ISSN:0020-7543    

DOI:10.1080/00207548808947940

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor