Open Access. Powered by Scholars. Published by Universities.®
Operations and Supply Chain Management Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 31 - 41 of 41
Full-Text Articles in Operations and Supply Chain Management
Dynamic Slotting Optimization Based On Skus Correlations In A Zone-Based Wave-Picking System, Li Yingde, Jeffery S. Smith
Dynamic Slotting Optimization Based On Skus Correlations In A Zone-Based Wave-Picking System, Li Yingde, Jeffery S. Smith
12th IMHRC Proceedings (Gardanne, France – 2012)
Many exiting slotting methods ignore the picking correlations between Stock Keeping Units (SKUs). In a previous paper, a mix integer program model for dynamic slotting to minimize the pick-wave makespan among all zones under some load balancing constraints was developed. In this paper, we develop an ant colony optimization with slot-exchange policy (ACO-SE) based on SKU correlation to assign the correlated SKUs to the adjacent slots in the same zone. The ACO-SE deposits pheromones between SKUs, uses local and global pheromone trail updates, and controls pheromone accumulation using the Max-Min rule. The main heuristic information is set to the correlation …
An Extended Double Row Layout Problem, Chase C. Murray, Xingquan Zuo, Alice E. Smith
An Extended Double Row Layout Problem, Chase C. Murray, Xingquan Zuo, Alice E. Smith
12th IMHRC Proceedings (Gardanne, France – 2012)
The double row layout problem (DRLP) seeks to determine optimal machine locations on either side of an aisle, where the objective has been defined as the minimization of material ow cost among ma- chines while meeting machine clearance constraints. In this paper, we extend existing DRLP formulations in two respects. First, we consider the minimization of layout area besides the usual material ow cost objective. Second, we present a mixed integer linear programming formulation that permits non-zero aisle widths. This new formulation also includes new constraints that eliminate layout \mirroring," thus reducing the solution space significantly and thus solution times. …
Robust Material Handling System Design Based On The Risk Versus Cost Tradeoff, Marc Goetschalckx, Edward Huang, Pratik Mital
Robust Material Handling System Design Based On The Risk Versus Cost Tradeoff, Marc Goetschalckx, Edward Huang, Pratik Mital
12th IMHRC Proceedings (Gardanne, France – 2012)
The design and planning of major material handling systems belongs to the class of systems design problems under uncertainty. The overall structure of the system is decided during the current design stage, while the values of the future conditions and the future planning decisions are not known with certainty. Typically the future uncertainty is modeled through a number of scenarios and each scenario has an individual timediscounted total system cost. The overall performance of the material handling system is characterized by the distribution of these scenario costs. The central tendency of the cost distribution is almost always computed as the …
Toward Sustainability, High Density And Short Response Time By Live-Cube Storage Systems, Nima Zaerpour, Yugang Yu, René De Koster
Toward Sustainability, High Density And Short Response Time By Live-Cube Storage Systems, Nima Zaerpour, Yugang Yu, René De Koster
12th IMHRC Proceedings (Gardanne, France – 2012)
This paper studies random storage in a live-cube storage system where loads are stored multi-deep. Although such storage systems are still rare, they are increasingly used, for example in automated car parking systems. Each load is accessible individually and can be moved to a lift on every level of the system in x- and y-directions by a shuttle as long as an open slot is available next to it, comparable to Sam Loyd’s sliding puzzles. A lift moves the loads across different levels in z-direction. We derive the expected travel time of a random load from its storage location to …
Process Analysis For Material Flow Systems, Thorsten Schmidt, David Wustmann, Robert Schmaler
Process Analysis For Material Flow Systems, Thorsten Schmidt, David Wustmann, Robert Schmaler
12th IMHRC Proceedings (Gardanne, France – 2012)
This paper describes a generic approach for analysis of internal behavior of logistic systems based on event logs. The approach is demonstrated by an example of event data from the simulation model of an automated material handling system (MHS) in a manufacturing company. The purpose of the analysis is the identification of design and operation problems and their causes, prospectively. As a result, the simulation model developer obtains the condensed and ranked information on events. These events describe the internal system behavior with anomalies pointing at either possible problems or capacity reserves.
A Study On Storage Allocation In An Automated Semiconductor Manufacturing Facility, St´Ephane Dauz`Ere-P´Er`Es, Claude Yugma, Ahmed Ben Chaabane, Ahmed Ben Chaabane, Lionel Rulli`Ere, Gilles Lamiable
A Study On Storage Allocation In An Automated Semiconductor Manufacturing Facility, St´Ephane Dauz`Ere-P´Er`Es, Claude Yugma, Ahmed Ben Chaabane, Ahmed Ben Chaabane, Lionel Rulli`Ere, Gilles Lamiable
12th IMHRC Proceedings (Gardanne, France – 2012)
This paper deals with the allocation of storage capacity in the automated material handling environment of a semiconductor wafer manufacturing facility. The impact of the allocation of stokers to machines in semiconductor fabrication facilities (fabs) is very little studied, although it significantly impacts the efficiency of the Automated Material Handling System (AMHS). After motivating and describing the problem of allocating unitary stokers to machines, a first local approach is discussed. We then propose a Mixed Integer linear Programming model to solve the global problem with two objectives: Minimizing the total maximum travel distance of vehicles and balancing the utilization of …
Design & Modeling Of A Single Machine Flow Rack As/Rs, Zaki Sari, Nadir Hakim Bessenouci
Design & Modeling Of A Single Machine Flow Rack As/Rs, Zaki Sari, Nadir Hakim Bessenouci
12th IMHRC Proceedings (Gardanne, France – 2012)
In this paper, we aim to introduce a new variation of the flow rack automated storage and retrieval system (AS/RS) using a single machine for storage and retrieval operations instead of two machines. Also, analytical expressions are derived for expected single and dual cycle times of the storage and retrieval machine. For that, randomized storage assignment, and Tchebychev travel are assumed. Two dwell point positions are investigated and compared to determine the best one. Finally an experimental validation using simulation is conducted to verify the quality of the developed.
An Mip Approach To The U-Line Balancing Problem With Proportional Worker Throughput, Reyhan Erin, Andres L. Carrano, Moises Sudit
An Mip Approach To The U-Line Balancing Problem With Proportional Worker Throughput, Reyhan Erin, Andres L. Carrano, Moises Sudit
12th IMHRC Proceedings (Gardanne, France – 2012)
One of the major challenges faced by manufacturing companies is to remain competitive in dynamic environments, where fluctuations in customer demand and production rates require systems capable of adapting in a practical and economical way. A U-shaped production cell is considered one of the most flexible designs for adapting the workforce level to varying conditions. However, re-balancing efforts are time consuming and often require a new work allocation and line design. In this paper, a two-stage MIP model to determine the best cell design under varying workforce levels is proposed. The model seeks to maintain proportionality between throughput and the …
A Yard Crane Scheduling Problem With Practical Constraints, Amin Hossein Gharehgozli, Yugang Yu, Rene De Koster, Gilbert Laporte
A Yard Crane Scheduling Problem With Practical Constraints, Amin Hossein Gharehgozli, Yugang Yu, Rene De Koster, Gilbert Laporte
12th IMHRC Proceedings (Gardanne, France – 2012)
The problem considered in this paper is to locate storage containers while a set of container storage and retrieval requests are sequenced. Two automated cranes stack and retrieve containers in a single block of a yard. The cranes cannot pass each other and must be separated by a safety distance. Storage containers are initially located at the seaside and land side input/output (I/O) points of the block. Each must be stacked in a specific location of the block, selected from a set of open locations suitable for stacking the storage container. Retrieval containers are initially located in the block and …
Modeling The Inventory Requirement And Throughput Performance Of Picking Machine Order-Fulfillment Technology, Jennifer A. Pazour, Russell D. Meller
Modeling The Inventory Requirement And Throughput Performance Of Picking Machine Order-Fulfillment Technology, Jennifer A. Pazour, Russell D. Meller
12th IMHRC Proceedings (Gardanne, France – 2012)
Picking machines, also known as remote-order-picking systems, are an example of a stock-to-picker piece-level order-fulfillment technology that consists of two or more pick stations and a common storage area. An integrated closed-loop conveyor decouples the pick stations from the storage area by transporting the needed totes to and from the storage area and the pick stations. We develop a probabilistic model capable of quantifying the inventory differences between order-fulfillment technologies that pool inventory with technologies that do not pool inventory. To determine the throughput of a picking machine, we develop a methodology that incorporates existing analytical models for the picking …
Dock Assignment And Truck Scheduling Problems At Cross-Docking Terminals, Ching-Jung Ting, Amanda G. Rodríguez López
Dock Assignment And Truck Scheduling Problems At Cross-Docking Terminals, Ching-Jung Ting, Amanda G. Rodríguez López
12th IMHRC Proceedings (Gardanne, France – 2012)
In this paper, we consider the integration of dock assignment and truck scheduling problem at cross-docking terminals. The problem is first formulated as a 0-1 integer programming model. Since both dock assignment and truck scheduling problems are NP-hard, its integration is more difficult to solve. Thus we propose reduced variable neighborhood search (RVNS) algorithms to solve the problem. Computational experiments are carried out on four set of instances. The results show that RVNS is capable of finding good solutions in a much shorter computation time when it is compared with optimization solver Gurobi’s solutions.