scholarly journals Solving the time-discrete winter runway scheduling problem: A column generation and constraint programming approach

Author(s):  
Maximilian Pohl ◽  
Christian Artigues ◽  
Rainer Kolisch
Constraints ◽  
2010 ◽  
Vol 16 (3) ◽  
pp. 317-340 ◽  
Author(s):  
András Kovács ◽  
Tamás Kis

2014 ◽  
Vol 681 ◽  
pp. 265-269
Author(s):  
Yan Li ◽  
Zhi Run Xiao

The problem of multi-skilled project scheduling (MSPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many software company. In this paper we present a constraint programming (CP) approach for the MSPSP. We extend the project scheduling literature by developing a project scheduling model that accounts for differing skills among workers. The computational results for the MSPSP show that the constraint programming approach increases the performance of the model solving processes. The results for the MSPSP is effective in solving the proposed problem.


2014 ◽  
Vol 631-632 ◽  
pp. 1295-1299
Author(s):  
Yan Li ◽  
Zhi Run Xiao ◽  
Wen Qing Dou ◽  
Ying Yang

The Skilled Workforce Project Scheduling Problem (SWPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many company Service Centers. In this paper we present a constraint programming (CP) approach for the SWPSP. We extend the project scheduling literature by developing a project scheduling model that accounts for differing skills among workers. The computational results for the SWPSP show that the constraint programming approach increases the performance of the model solving processes. The results for the SWPSP is effective in solving the proposed problem.


2014 ◽  
Vol 536-537 ◽  
pp. 1669-1673
Author(s):  
Yan Li ◽  
Zhi Run Xiao ◽  
Wen Qing Dou ◽  
Ying Yang

The Skilled Workforce Project Scheduling Problem (SWPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many company Service Centers. In this paper we present a constraint programming (CP) approach for the SWPSP. We extend the project scheduling literature by developing a project scheduling model that accounts for differing skills among workers. The computational results for the SWPSP show that the constraint programming approach increases the performance of the model solving processes. The results for the SWPSP is effective in solving the proposed problem.


2010 ◽  
Vol 184 (1) ◽  
pp. 163-178 ◽  
Author(s):  
Nizar El Hachemi ◽  
Michel Gendreau ◽  
Louis-Martin Rousseau

Sign in / Sign up

Export Citation Format

Share Document