A Solution Method for the Maritime Pilot Scheduling Problem with Working Hour Regulations

2021 ◽  
Vol 38 (03) ◽  
pp. 2040015
Author(s):  
Liyang Xiao ◽  
Zhengpei Wang ◽  
Zheyi Tan ◽  
Chenghao Wang
Keyword(s):  
Variable Neighborhood Search ◽  
Solution Method ◽  
Operating Cost ◽  
Operating Costs ◽  
Mixed Integer ◽  
Traditional Scheduling ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Scheduling Method ◽  
Working Hour

Motivated by real needs of the industry, this paper studies a maritime pilot scheduling problem with working hour regulations. The existing traditional manual scheduling method of the targeted pilot station is actually a greedy-based approach which may lead to an extremely high operating cost solution and also some dissatisfaction of pilots. A mixed-integer programming (MIP)-based formulation is established and a variable neighborhood search (VNS) approach is proposed to solve the problem efficiently. Compared to the traditional scheduling method, the VNS approach significantly reduces the operating costs in different scales of realistic instances. At the same time, working time and working timespan of pilots are also prominently reduced, which hence directly reduce the workloads of pilots and improve their job satisfaction.

scholarly journals Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

2012 ◽  
Vol 2012 ◽  
pp. 1-20 ◽  
Author(s):  
Wenming Cheng ◽  
Peng Guo ◽  
Zeqiang Zhang ◽  
Ming Zeng ◽  
Jian Liang
Keyword(s):  
Variable Neighborhood Search ◽  
Parallel Machines ◽  
Programming Model ◽  
Search Algorithm ◽  
Optimal Schedule ◽  
Deteriorating Jobs ◽  
Mixed Integer ◽  
Computational Time ◽  
Neighborhood Search ◽  
Scheduling Problem

In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

scholarly journals Multiobjective Scheduling of Logistics UAVs Based on Variable Neighborhood Search

2020 ◽  
Vol 10 (10) ◽  
pp. 3575
Author(s):  
Yixuan Li ◽  
Xiaoxiang Yuan ◽  
Jie Zhu ◽  
Haiping Huang ◽  
Min Wu
Keyword(s):  
Variable Neighborhood Search ◽  
Optimal Solution ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Small Scale ◽  
Scheduling Problem ◽  
Scale Problem ◽  
Multiple Uavs ◽  
Aerial Vehicle ◽  
Encoding Method

This study focuses on the issue of logistics Unmanned Aerial Vehicle (UAV) distribution in urban environment and an automatic delivery system to support the delivery of packages. It can effectively integrate existing facilities and be easily deployed. There is a scheduling problem in this system with multiple UAVs and multiple flights. We manage to optimize the two objectives of customer satisfaction and total completion time. The scheduling problem is formulated to a Mixed Integer Linear Programming (MILP), and we propose a multiple objectives decision-making method. A special encoding method suitable for the small scale problem is presented and Variable Neighborhood Search (VNS) algorithm framework is used to generate the approximate optimal solution for this problem. In experiments, we calibrate the important parameter and analyze the robustness of the algorithm. The experimental results show that the proposed algorithms are efficient for this problem.

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.

Sign in / Sign up

Export Citation Format

Share Document