Polynomial transfer lot sizing techniques for batch processing on consecutive machines
MetadataShow full item record
Using transfer lots, we can overlap the processing of a batch on several consecutive machines, and thus reduce the makespan considerably. This in turn promotes work-in-process reduction. In this paper we investigate the transfer lots sizing problem for a given batch size under two operating procedures. Our objective is to minimize the makespan subject to a transferring budget. An important part of the solution involves partitioning the problem to subsets of machines without losing optimality. For each part (subset), the first and the last machines operate continuously while intermediate machines may idle intermittently. The first operating procedure we consider calls for the lots to be identical across all machines in each subset. The second operating procedure allows sub-lots for some of the machines or for some of the lots. Through more elaborate, the second operating procedure yields demonstrably superior results. The techniques provide satisfying feasible solutions, which can also serve as efficient bounds for an exact branch and bound inter linear programming model. (KR)
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
NPS Report NumberNPS-54-89-011
Showing items related by title, author, creator and subject.
Shaeffer, Blanca A. (Monterey, California. Naval Postgraduate School, 2000-03-01);Nowadays, it is common to see the use of a network of machines to distribute the workload and to share information between machines. In these distributed systems, the scheduling of resources to applications may be accomplished ...
Sasao, Tsutomu; Nakahara, Hiroki; Matsuura, Munehiro; Kawamura, Yoshifumi; Butler, Jon T. (2010-08);This paper first reviews the trends of VLSI design, focusing on the power dissipation and programmability. Then, we show the advantage of Quarternary Decision Diagrams (QDDs) in representing and evaluating logic functions. ...
Kadarma, Johny (Monterey, California. Naval Postgraduate School, 1989-09);The evolution in network and communication technology has led to the need to interconnect individual computer networks. Network designers are faced with the heterogeneity of networks just as they were previously faced with ...