An optimal algorithm for a two runway scheduling problem

2012 ◽  
Vol 227 (7) ◽  
pp. 1122-1129 ◽  
Author(s):  
Amrish Ravidas ◽  
Sivakumar Rathinam ◽  
Zachary Wood
Keyword(s):  
Optimal Algorithm ◽  
Scheduling Problem ◽  
Runway Scheduling

scholarly journals Time-Indexed Formulations for the Runway Scheduling Problem

2017 ◽  
Vol 51 (4) ◽  
pp. 1196-1209 ◽  
Author(s):  
Pasquale Avella ◽  
Maurizio Boccia ◽  
Carlo Mannino ◽  
Igor Vasilyev
Keyword(s):  
Scheduling Problem ◽  
Runway Scheduling

A branch and cut heuristic for a runway scheduling problem

2016 ◽  
Vol 77 (11) ◽  
pp. 1985-1993 ◽  
Author(s):  
I. L. Vasilyev ◽  
P. Avella ◽  
M. Boccia
Keyword(s):  
Branch And Cut ◽  
Scheduling Problem ◽  
Runway Scheduling

scholarly journals An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Weimin Ma ◽  
Bo Xu ◽  
Ming Liu ◽  
Hui Huang
Keyword(s):  
Approximation Algorithm ◽  
Numerical Study ◽  
Scheduling Problem ◽  
Np Hard ◽  
Scheduling System ◽  
Efficient Approximation Algorithm ◽  
Sequencing And Scheduling ◽  
Permutation Problem ◽  
Efficient Approximation ◽  
Runway Scheduling

The aircraft arrival sequencing and scheduling (ASS) problem is a salient problem in airports' runway scheduling system, which proves to be nondeterministic polynomial (NP) hard. This paper formulates the ASS in the form of a constrained permutation problem and designs a new approximation algorithm to solve it. Then the numerical study is conducted, which validates that this new algorithm has much better performance than ant colony (AC) algorithm and CPLEX, especially when the aircraft types are not too many. In the end, some conclusions are summarized.

An Optimal Algorithm for Scheduling with Variable Job Processing Times and Rejection

2015 ◽  
Vol 775 ◽  
pp. 449-452
Author(s):  
Ji Bo Wang ◽  
Chou Jung Hsu
Keyword(s):  
Objective Function ◽  
Polynomial Time ◽  
Single Machine ◽  
Processing Time ◽  
Optimal Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Rejection Penalty

This paper studies a single machine scheduling problem with rejection. Each job has a variable processing time and a rejection penalty. The objective function is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. We show that the problem can be solved in polynomial time.

scholarly journals The aircraft runway scheduling problem: A survey

2021 ◽  
Vol 132 ◽  
pp. 105336
Author(s):  
Sana Ikli ◽  
Catherine Mancel ◽  
Marcel Mongeau ◽  
Xavier Olive ◽  
Emmanuel Rachelson
Keyword(s):  
Scheduling Problem ◽  
Runway Scheduling

Research on Dynamic Scheduling of Job-Shop Production with the Ant Colony Optimal Algorithm

2007 ◽  
Vol 10-12 ◽  
pp. 109-113
Author(s):  
Yong Xian Liu ◽  
J. Xiong ◽  
B.M. Sun
Keyword(s):  
Production Management ◽  
Job Shop ◽  
Dynamic Scheduling ◽  
Job Shop Scheduling ◽  
Optimal Algorithm ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Multi Agent ◽  
High Computational Complexity

Job-shop dynamic scheduling is an important subject in the fields of production management and combinatorial optimization. It is usually hard to achieve the optimal solution with classical methods due to the high computational complexity of the problem. A solution of job-shop scheduling problem based on multi-agent is presented for the comparability between the dynamic scheduling problem of job-shop production and the TSP problem. The dynamic scheduling of job-shop production is designed according to the pattern of TSP problem which can be applied with ACO. By the application case, the ACO is the new method to solve the dynamic scheduling of job-shop production.

Sign in / Sign up

Export Citation Format

Share Document