摘要:

Four approaches extending purely linear programming (LP) models for medium term production planning in order to consider minimum lotsizes are presented and compared on the basis of a real world production planning problem of a West German food manufacturer. Two approaches focus on different mixed-binary model formulations of minimum lotsizes. The other two approaches are variants of a heuristic period by period rounding procedure for production amounts resulting from a repeatedly optimized LP model.

ISSN:0020-7543    

DOI:10.1080/00207548808947884

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

This paper describes a study which explores human decision-making abilities in scheduling and dispatching of a flexible manufacturing system (FMS) An experiment is described, using an FMS, in which subjects make scheduling and dispatching decisions using a real-time interactive computer-simulation based system. The experimental results demonstrate that human decision-making is superior to general dispatching rules. An explanation of these results and an analysis of subjects' behaviour is presented in the light of information obtained from verbal protocol data

ISSN:0020-7543    

DOI:10.1080/00207548808947885

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

This paper presents three quasi on-line scheduling procedures for FMSs consisting of work stations, transport devices, and operators. In the scheduling, different types of decisions are taken to perform a particular operation, i.e. the selection of (a) a work station, (b) a transport device and (c) an operator. Further, (d) the scheduling sequence of the operations has to be determined. The three developed procedures differ in the way these four decision problems are solved hierarchically. Several dispatching rules (SPT, SPT.TOT, SPT/ TOT and EFTA) are available to solve the last mentioned decision problem. Limited buffer capacities in an FMS may cause deadlock in the procedures as well as in practice. The scheduling procedures involve a buffer handling method to avoid deadlock. A case study is presented to demonstrate the three procedures and to show some of its properties. Based on simulation tests, some conclusions are drawn about the performance of the scheduling procedures and the various dispatching rules.

ISSN:0020-7543    

DOI:10.1080/00207548808947886

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

A special tool for using robots in intelligent industrial assembly is presented. The semantic network is the model Tor knowledge base organization. Planning is done by means of a special kind of production rules named demons. A dedicated NON-VON machine GRAM ( GRAph Machine) stands at the basis of intelligent robot programming. Finally an example of using GRAM in industrial assembly is discussed.

ISSN:0020-7543    

DOI:10.1080/00207548808947887

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

In this paper we consider an n jobs one machine sequencing problem in which all jobs have a common due date and a deviation in its completion time occurs when a job is completed before or after the common due date. The objective is to find an optimal value of this common due date and a corresponding optimal sequence such that the mean absolute deviation of the completion times of the jobs in the optimal sequence from the corresponding optimal common due date is at its global minimum. Starting with an arbitrary sequence we relate the problem to a generalized linear goal program from which some basic results are proved using elementary properties of linear equations and a linear goal programming problem. Using these results and the idea of sensitivity analysis in linear programming, an algorithm is developed that determines the optimal due date and the corresponding optimal sequence yielding the global minimum value of the mean absolute deviation of the completion times of the jobs in the optimal sequence from the corresponding optimal common due date. In the end a numerical example to explain the algorithm is provided.

ISSN:0020-7543    

DOI:10.1080/00207548808947888

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

Reconstructability analysis is a package of methodological tools for dealing with the relationship between wholes and parts in the context of computer-aided systems modelling. The applicability of reconstructability analysis in industrial engineering and production reseach, which is the primary purpose of this paper, is illustrated by simple examples based upon data obtained from psychophysiological and ergonomic experiments under real working conditions.

ISSN:0020-7543    

DOI:10.1080/00207548808947889

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

Scheduling in process industries is exceedingly challenging, due to the high capital intensity, relatively long and sequence-dependent setup times, and extremely limited capacity resources that are found in these industries. As a result, it is important to simultaneously consider lot sizing and sequencing factors in the development of a production schedule. This paper presents a mixed integer linear programming model for scheduling production in process industries that embodies the economic trade-offs encompassed in three avenues of research: capacitated lot sizing, flowshop scheduling and sequencing with sequence-dependent setup times. The model is used to schedule production Tor a problem representative of those found in the food processing industry. The corresponding schedule is then compared with approaches that consider lot sizing and sequencing as independent decisions and it is shown that decomposing the scheduling problem into smaller subproblems can result in the generation of infeasible production schedules.

ISSN:0020-7543    

DOI:10.1080/00207548808947890

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

A graphical procedure is developed for deciding when to change from single shift production to double shift production, and vice-versa. The changeover times must satisfy the rule that the ratio of orders filled from inventory to orders filled from back-order equals the ratio of the back-order cost to the inventory cost. The ‘ inventory/ back-order’ rule is illustrated with cumulative production and cumulative demand curves.

ISSN:0020-7543    

DOI:10.1080/00207548808947891

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

摘要:

In this paper, an approximation method is given for the analysis of flow lines with a continuous product flow. The algorithm is an improvement of an earlier developed method. It is applied here to lines in which the machines are unreliable with exponentially distributed life and repair times. All intermediate buffers have finite capacity. The algorithm consists of repeated decomposition and aggregation steps, in which two-stage lines are approximated by a single machine. The method appears to be fast and performs well for lines which are not too long.

ISSN:0020-7543    

DOI:10.1080/00207548808947892

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor

ISSN:0020-7543    

DOI:10.1080/00207548808947894

出版商:Taylor & Francis Group    

年代:1988

数据来源: Taylor