scholarly journals The integrated orderline batching, batch scheduling, and picker routing problem with multiple pickers: the benefits of splitting customer orders

2021 ◽  
Author(s):  
Mustapha Haouassi ◽  
Yannick Kergosien ◽  
Jorge E. Mendoza ◽  
Louis-Martin Rousseau
Keyword(s):  
Batch Scheduling ◽  
Routing Problem ◽  
Customer Orders

scholarly journals Mathematical models for a batch scheduling problem to minimize earliness and tardiness

2018 ◽  
Vol 11 (3) ◽  
pp. 390 ◽  
Author(s):  
Basar Ogun ◽  
Çigdem Alabas-Uslu
Keyword(s):  
Mathematical Models ◽  
Real World ◽  
Lean Manufacturing ◽  
Programming Model ◽  
Computational Study ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Earliness And Tardiness ◽  
Customer Orders

Purpose: Today’s manufacturing facilities are challenged by highly customized products and just in time manufacturing and delivery of these products. In this study, a batch scheduling problem is addressed to provide on-time completion of customer orders in the environment of lean manufacturing. The problem is to optimize partitioning of product components into batches and scheduling of the resulting batches where each customer order is received as a set of products made of various components.Design/methodology/approach: Three different mathematical models for minimization of total earliness and tardiness of customer orders are developed to provide on-time completion of customer orders and also, to avoid from inventory of final products. The first model is a non-linear integer programming model while the second is a linearized version of the first. Finally, to solve larger sized instances of the problem, an alternative linear integer model is presented.Findings: Computational study using a suit set of test instances showed that the alternative linear integer model is able to solve all test instances in varying sizes within quite shorter computer times comparing to the other two models. It was also showed that the alternative model can solve moderate sized real-world problems.Originality/value: The problem under study differentiates from existing batch scheduling problems in the literature since it includes new circumstances which may arise in real-world applications. This research, also, contributes the literature of batch scheduling problem by presenting new optimization models.

scholarly journals The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem

2009 ◽  
Vol 5 (4) ◽  
pp. 749-765 ◽  
Author(s):  
Tao Zhang ◽  
◽  
W. Art Chaovalitwongse ◽  
Yue-Jie Zhang ◽  
P. M. Pardalos ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Hot Rolling ◽  
Vehicle Routing Problem ◽  
Batch Scheduling ◽  
Routing Problem ◽  
Scheduling Method ◽  
Prize Collecting

scholarly journals Research on hot rolling scheduling problem based on Two-phase Pareto algorithm

PLoS ONE ◽  
2020 ◽  
Vol 15 (12) ◽  
pp. e0241077
Author(s):  
Wang Chen ◽  
Zhang Xiufeng ◽  
Zhao Guohua
Keyword(s):  
Energy Consumption ◽  
Energy Saving ◽  
Vehicle Routing ◽  
Hot Rolling ◽  
Vehicle Routing Problem ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Two Phase ◽  
Routing Problem ◽  
Multi Objective

Under the background of excess capacity and energy saving in iron and steel enterprises, the hot rolling batch scheduling problem based on energy saving is a multi-objective and multi constraint optimization problem. In this paper, a hybrid multi-objective prize-collecting vehicle routing problem (Hybrid Price Collect Vehicle Routing Problem, HPCVRP) model is established to ensure minimum energy consumption, meet process rules, and maximize resource utilization. A two-phase Pareto search algorithm (2PPLS) is designed to solve this model. The improved MOEA/D with a penalty based boundary intersection distance (PBI) algorithm (MOEA/D-PBI) is introduced to decompose the HPCVRP in the first phase. In the second phase, the multi-objective ant colony system (MOACS) and Pareto local search (PLS) algorithm is used to generate approximate Pareto-optimal solutions. The final solution is then selected according to the actual demand and preference. In the simulation experiment, the 2PPLS is compared with five other algorithms, which shows the superiority of 2PPLS. Finally, the experiment was carried out on actual slab data from a steel plant in Shanghai. The results show that the model and algorithm can effectively reduce the energy consumption in the process of hot rolling batch scheduling.

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Sign in / Sign up

Export Citation Format

Share Document