scholarly journals Variable Neighborhood Search for Major League Baseball Scheduling Problem

2021 ◽  
Vol 13 (7) ◽  
pp. 4000
Author(s):  
Yun-Chia Liang ◽  
Yen-Yu Lin ◽  
Angela Hsiang-Ling Chen ◽  
Wei-Sheng Chen
Keyword(s):  
Standard Deviation ◽  
Variable Neighborhood Search ◽  
Major League Baseball ◽  
Leisure Activities ◽  
Critical Role ◽  
Modern Society ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Major League

Modern society pays more and more attention to leisure activities, and watching sports is one of the most popular activities for people. In professional leagues, sports scheduling plays a very critical role. To efficiently arrange a schedule while complying with the relevant rules in a sports league has become a challenge for schedule planners. This research uses Major League Baseball (MLB) of the year 2016 as a case study. The study proposed the Variable Neighborhood Search (VNS) algorithm with different coding structures to optimize the objective function—minimize the total travelling distance of all teams in the league. We have compared the algorithmic schedules with the 2016 and 2019 MLB regular-season schedules in the real-world case for its performance evaluation. The results have confirmed success in reducing the total travelling distances by 2.48% for 2016 and 6.02% in 2019 while lowering the standard deviation of total travelling distances by 7.06% for 2016.

scholarly journals Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

2020 ◽  
Author(s):  
Moussa Abderrahim ◽  
Abdelghani Bekrar ◽  
Damien Trentesaux ◽  
Nassima Aissani ◽  
Karim Bouamrane
Keyword(s):  
Manufacturing Systems ◽  
Variable Neighborhood Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Efficient Production ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

AbstractIn job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.

General Variable Neighborhood Search for the Data Mule Scheduling Problem

2018 ◽  
Vol 66 ◽  
pp. 71-78
Author(s):  
Pablo Luiz Araújo Munhoz ◽  
Pedro Henrique González ◽  
Uéverton dos Santos Souza ◽  
Luiz Satoru Ochi ◽  
Philippe Michelon ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Data Mule
Sign in / Sign up

Export Citation Format

Share Document