scholarly journals A Heuristic Solution Approach to Order Batching and Sequencing for Manual Picking and Packing Lines considering Fatiguing Effect

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Xiaochun Feng ◽  
Xiangpei Hu
Keyword(s):  
Similarity Index ◽  
Setup Time ◽  
Daily Basis ◽  
Heuristic Approach ◽  
Logistic Growth ◽  
Start Time ◽  
Heuristic Solution ◽  
Order Batching ◽  
Solution Approach ◽  
Order Processing

In this research, we study an extended version of the joint order batching and scheduling optimization for manual vegetable order picking and packing lines with consideration of workers’ fatiguing effect. This problem is faced by many B2C fresh produce grocers in China on a daily basis which could severely decrease overall workflow efficiency in distribution center and customer satisfaction. In this order batching and sequencing problem, the setup time for processing each batch is volume-dependent and similarity dependent, as less ergonomic motion is needed in replenishing and picking similar orders. In addition, each worker’s fatiguing effect, usually caused by late shift and repetitive operation, which affects order processing times, is assumed to follow a general form of logistic growth with respect to the start time of order processing. We develop a heuristic approach to solve the resultant NP-hard problem for minimization of the total completion time. For order batching, a revised similarity index takes into account not only the number of common items in any two orders but also the proportion of these items based on the vegetable order feature. To sequence batches, the genetic algorithm is adapted and improved with proposed several efficient initialization and precedence rules. Within each batch, a revised nondecreasing item quantity algorithm is used. The performance of the proposed heuristic solution approach is evaluated using numerical instances generated from practical warehouse operations of our partnering B2C grocer. The efficiency of the proposed heuristic approach is demonstrated.

scholarly journals Minimizing Hiring Cost of the Machine Under No Idle Constraints in N*2 Flow Shop Scheduling with Transportation and Set Up Time.

2019 ◽  
Vol 9 (2) ◽  
pp. 5227-5229
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Idle Time ◽  
Flow Shop Scheduling ◽  
Start Time ◽  
Transportation Time ◽  
Shop Scheduling ◽  
Set Up

The present paper deals with a problem of n*2 flow shop scheduling where setup time of the machines are separated from their dispensation time and transportation time for moving from first machine to second machine is also given. Our aim is to get the most favorable jobs sequence which can make machines idle time equal to zero so that rental cost can be minimized. In order to ensure no idle constraint, we have developed an algorithm in which we have delayed the start time of machine B, so that machine B works continuously without any idle time. A simple mathematical example is also given to clear the concept.

A Heuristic Approach for GPS-Based Routing

2021 ◽  
Vol 13 (4) ◽  
pp. 71-84
Author(s):  
Larry J. LeBlanc ◽  
Thomas A. Grossman
Keyword(s):  
Vehicle Routing ◽  
Network Models ◽  
Heuristic Approach ◽  
Optimization Models ◽  
Integer Optimization ◽  
Time Data ◽  
Heuristic Solution ◽  
Package Delivery ◽  
Operations Control ◽  
And Control

Vehicle routing (such as for package delivery) presents challenges for operations planning and operations control. Planning ensures that vehicles are assigned to “good” routes, and control enables routes to be changed in real time in response to changes in destination requirements. Both planning and control can be accomplished using web-based, intelligent geographic information system tools to rapidly generate a heuristic solution using an embedded algorithm, rather than the established approach of using explicit customized optimization models. The authors contrast the established approach of using customized integer optimization models to a heuristic that integrates human judgment with Google Maps travel time data to solve vehicle routing problems. This paper discusses the data requirements, simplifying assumptions, and practical performance of both approaches. The advantage of the heuristic approach is that genuine, useful access to much of the power of highly sophisticated OR network models can be provided to large numbers of analytically unsophisticated managers, along with enhanced operational control.

Optimization Approaches for a Home Healthcare Routing and Scheduling Problem

2020 ◽  
pp. 75-101
Author(s):  
Juan Carlos Rivera ◽  
Victoria J. Zapata
Keyword(s):  
Health Care ◽  
Social Services ◽  
Home Health Care ◽  
Scheduling Problem ◽  
Heuristic Solution ◽  
Routing Problem ◽  
Solution Approach ◽  
Routing And Scheduling ◽  
Integer Linear Model ◽  
The City

Welfare community projects, mainly related to health care, are essential for the development of societies. For this reason, the optimization of its resources through methodologies that support decision making becomes of interest for all stakeholders in order to reach the target users. In Colombia, particularly in the city of Medellin, several social projects are being developed seeking to provide health and other social services to vulnerable populations. The purpose of this chapter is to deal with a real application of the home health care routing and scheduling problem (HHCRSP), in which a set of health professionals grouped by teams should visit a set of users geographically scatter over the city. Here, it is proposed a mixed integer linear model and a heuristic solution approach. The mathematical model is based on vehicle routing problem with pickups and deliveries (VRPPD) with additional features related with the specific application and geographical conditions.

A HEURISTIC APPROACH FOR SOLVING SERIALLY DISTRIBUTED STORAGE DEPOTS UNDER GENERAL-INTEGER POLICY

2007 ◽  
Vol 24 (04) ◽  
pp. 479-497 ◽  
Author(s):  
FANG-CHUAN LEE ◽  
UE-PYNG WEN
Keyword(s):  
Structure Analysis ◽  
Distribution System ◽  
Lot Sizing ◽  
Distributed Storage ◽  
Heuristic Method ◽  
Heuristic Approach ◽  
Cost Curve ◽  
Solution Approach ◽  
Curve Structure ◽  
Comparison Of The Results

In this study, we present the problems of shipping a single product from a single supply origin, through a serial system of storage depots, to a single demand destination by trucks or ships, and aim to minimize the sum of ordering, inventory and transportation costs over an infinite time horizon. We formulate the problem consisting of general-integer (GI), stationary and nested replenishment policies for the multistage inventory/distribution system. This paper presents the near-optimal cost-curve structure analysis for this serially distributed storage depot problem (SDSDP) and show that the ordering quantities for each storage depot always comply with the GI replenishment policy. Moreover, we develop a heuristic approach, which is based on an efficient search procedure to obtain satisfactory results. A comparison of the results obtained from the proposed heuristic method has been made with that from the LINGO® software on randomly generated problems. The proposed heuristic is the first solution approach in the literature to solve the single link problems based on the cost-curve structure analysis. Furthermore, we provide an important foundation for carrying out investigations on lot sizing and distribution problems with other supply chain configurations.

An exact solution approach for the order batching problem

2015 ◽  
Vol 47 (7) ◽  
pp. 728-738 ◽  
Author(s):  
İbrahim Muter ◽  
Temel Öncan
Keyword(s):  
Exact Solution ◽  
Order Batching ◽  
Solution Approach

Managing premium wines using an $$(s - 1,s)$$ inventory policy: a heuristic solution approach

2019 ◽  
Vol 280 (1-2) ◽  
pp. 351-376 ◽  
Author(s):  
Mauricio Varas ◽  
Franco Basso ◽  
Armin Lüer-Villagra ◽  
Alejandro Mac Cawley ◽  
Sergio Maturana
Keyword(s):  
Heuristic Solution ◽  
Inventory Policy ◽  
Solution Approach

scholarly journals Modelling and Optimizing an Open-Pit Truck Scheduling Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Yonggang Chang ◽  
Huizhi Ren ◽  
Shijie Wang
Keyword(s):  
Programming Model ◽  
Valid Inequalities ◽  
Upper Bounds ◽  
Open Pit ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Heuristic Solution ◽  
Solution Approach ◽  
Truck Scheduling ◽  
Improvement Strategies

This paper addresses a special truck scheduling problem in the open-pit mine with different transport revenue consideration. A mixed integer programming model is formulated to define the problem clearly and a few valid inequalities are deduced to strengthen the model. Some properties and two upper bounds of the problem are proposed. Based on these inequalities, properties, and upper bounds, a heuristic solution approach with two improvement strategies is proposed to resolve the problem and the numerical experiment demonstrates that the proposed solution approach is effective and efficient.

Sign in / Sign up

Export Citation Format

Share Document