摘要:

We consider the problem of minimizing makespan in two-machine no-wait flowshops with multiple products requiring lot streaming. A “product” (or lot) consists of many identical items. Lot streaming (lot sizing) is the process of creating sublots (or transfer batches to move the completed portion of a production )sublot to downstream machines so that operations can be overlapped. The number of sublots for each product is fixed. When the flowshop produces only a single product, we obtain optimal continuous-sized sublots. It is shown that these sublot sizes are also optimal for the problem of simultaneous lot streaming and scheduling of multiple products. The optimal scheduling of products can be accomplished by application of the algorithm due to Gilmore and Gomory [1]. Then, we devise an efficient heuristic for the problem of simultaneous lot streaming (finding optimal integer-sized sublots) and scheduling of multiple products. Computational results indicate that this heuristic can consistently deliver close-to-optimal solutions for the problem. A comparison of this heuristic is also made with a heuristic that first divides items belonging to each product into nearly equal-sized sublots and then constructs a schedule for such sublots. Finally, we extend our solution procedures to a traditional and more general lot streaming model, where the number of sublots for each product is a decision variable.

ISSN:0740-817X    

DOI:10.1080/07408179908969869

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

In this paper we address the scheduling problem in unpaced synchronous mixed-model production lines operated under a cyclic scheduling policy. We first discuss operations of a production line with the synchronous transfer of parts. We then present an integer programming formulation of the problem. The problem, however, is W-hard, and for its exact solution we propose an implicit enumeration scheme. We discuss a property of the scheduling problem which allows us to effectively solve large size instances of the problem. We also present an approximate solution procedure with very good avenge performance. Useful managerial insights are obtained as we search for ways to improve the performance of synchronous lines. The relaxation of one of our original assumptions in the scheduling problem formulation results in an easy problem whose solution generates the absolute best in throughput performance configuration of the production line. Implementation of this solution, however, requires increasing the number of buffers in the line. We suggest other performance improvement ways to better balance the tradeoff between throughput and average Work-In-Progress (WIP) inventory in the line.

ISSN:0740-817X    

DOI:10.1080/07408179908969870

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

This paper presents a branch-and-bound enumeration scheme for the makespan minimization of the permutation flow shop scheduling problem with sequence-dependent setup times. The algorithm includes the implementation of both lower and upper bounding procedures, a dominance elimination criterion, and special features such as a partial enumeration strategy. A computational evaluation of the overall scheme demonstrates the effectiveness of each component. Test results are provided for a wide range of problem instances.

ISSN:0740-817X    

DOI:10.1080/07408179908969871

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

In this paper, a dry kiln scheduling problem from the furniture manufacturing industry is considered. Factory-specified due dates for orders, kiln availability, kiln capacity, and travel time from the kilns to the factories are all incorporated in a model which is formulated as an integer linear program. The objective of the formulation is to minimize the maximum tardiness of orders arriving at the plants by solving a special case of schedulingnindependent jobs onmnon-identical parallel ciachines. Because of the computational complexity, and the fact that standard integer programming packages appear to perform very poorly on the problem, a heuristic approach is developed. Computational experience is provided which indicates that the heuristic gives very high quality solutions to problems in near real-time.

ISSN:0740-817X    

DOI:10.1080/07408179908969872

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

In this study, two shared storage assignment policies are compared in an Automated Storage/Retrieval System (AS/RS) by using computer simulation. The AS/RS is assumed to operate under a continuous review, order quantity, reorder point inventory policy. The average travel time of the AS/R machine for storing and retrieving products is used as the main performance measure. Sensitivity of the system to product variety, inventory replenishment lead time, and demand rate is investigated, as well as the effects of the inventory policy and the product classification technique used. Our main conclusion is that the turnover-based policy, in general, outperforms the duration of stay-based policy. However, the' difference between the performance of the two policies becomes insignificant under certain conditions.

ISSN:0740-817X    

DOI:10.1080/07408179908969873

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

We present a literature survey on methods and techniques for the planning and control of warehousing systems. Planning refers to management decisions that affect the intermediate term (one or multiple months), such as inventory management and storage location assignment. Control refers to the operational decisions that affect the short term (hours, day), such as routing, sequencing, scheduling and order-batching. Prior to the literature survey, we give an introduction into warehousing systems and a classification of warehouse management problems

ISSN:0740-817X    

DOI:10.1080/07408179908969874

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

A trim placement problem from the apparel industry is presented and solved. The problem is related to cutting and packing problems, which have received attention in the literature for close to 40 years. The problem is motivated by a pants layout problem involving irregularly-shaped pieces. A two-stage strategy is commonly employed, with large pieces, or panels, arranged first, followed by smaller pieces, or trim. This paper assumes the panels have been arranged, and presents an approach for placing the trim pieces into unused “containers” of the stock material. Groups of trim pieces are first generated using existing polygon containment algorithms. Then, groups are assigned to containers to maximize a weighted function of the trim pieces. The mathematical programming formulation is developed, which is a generalization of the Maximum Cover Problem, a well-known problem in the location literature. Due to wide variability in branch and bound solution times, a Lagrangian Heuristic incorporating an improvement heuristic is developed. Computational experience demonstrates the effectiveness of the Lagrangian Heuristic on real pants markers. The optimal solution is found for all, and solution times are less than branch and bound in 10 out of 12 problem instances (considerably less in three), and only slightly more in the other two. Times are also less variable than branch and bound, an important characteristic with an interactive layout system.

ISSN:0740-817X    

DOI:10.1080/07408179908969875

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

This paper discusses pertinent issues in applying CONstant Work-In-Process (CONWIP) principles to control shop floor operations in a manufacturing environment characterized by several product families processed along different routes in several production cells. The approach we take is to simultaneously answer two major questions: (1) what is the best WIP level? and (2) how to arrange the backlog list for a given system? The problem is posed as a mathematical programming model and solved via a simulated annealing heuristic. We design an experiment that captures essential elements of the systems under investigation. We then execute an extensive simulation to evaluate the effectiveness of various control schemes in a multi-cell, multi-family production environment. Specifically, we compare two variants of CONWIP control, one where containers are restricted to stay within given cells all the time and the other where containers are allowed to move through the entire system. We demonstrate the superiority of the latter in all the simulated scenarios.

ISSN:0740-817X    

DOI:10.1080/07408179908969876

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

摘要:

In this paper, we describe an analytical model to determine contracting policies for a firm that purchases components from external suppliers. The model evaluates the tradeoff between the flexibility offered by short term contracts arid the fixed investments, improvement opportunities and price certainty associated with long term contracts. We show that long term contracts may not always be optimal, and discuss conditions under which short term contracts may be justified. During a recent survey of supply managers, we observed that managers often tend to participate in short term contracts, even though they claim to seek long term relationships with suppliers. Sensitivity analysis of our model provides some explanation for this observed inconsistency. We also discuss managerial implications of the analysis.

ISSN:0740-817X    

DOI:10.1080/07408179908969877

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor

ISSN:0740-817X    

DOI:10.1080/07408179908969878

出版商:Taylor & Francis Group    

年代:1999

数据来源: Taylor