A constraint programming approach to the multiple-venue, sport-scheduling problem

2006 ◽  
Vol 33 (7) ◽  
pp. 1895-1906 ◽  
Author(s):  
Robert A. Russell ◽  
Timothy L. Urban
Keyword(s):  
Constraint Programming ◽  
Programming Approach ◽  
Scheduling Problem ◽  
Sport Scheduling

scholarly journals Constraint programming approach to a bilevel scheduling problem

Constraints ◽  
2010 ◽  
Vol 16 (3) ◽  
pp. 317-340 ◽  
Author(s):  
András Kovács ◽  
Tamás Kis
Keyword(s):  
Constraint Programming ◽  
Programming Approach ◽  
Scheduling Problem

A Constraint-Based Approach for Multi-Skilled Project Scheduling Problem

2014 ◽  
Vol 681 ◽  
pp. 265-269
Author(s):  
Yan Li ◽  
Zhi Run Xiao
Keyword(s):  
Constraint Programming ◽  
Project Scheduling ◽  
Complex Problem ◽  
Programming Approach ◽  
Scheduling Problem ◽  
Computational Results ◽  
Resource Assignment ◽  
Software Company ◽  
Scheduling Model ◽  
Project Scheduling Problem

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.

scholarly journals Pengembangan algoritma programa pembatas untuk penjadwalan job-shop

2021 ◽  
Vol 20 (1) ◽  
pp. 15
Author(s):  
Bobby Kurniawan
Keyword(s):  
Constraint Programming ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Programming Approach ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Manufacturing Company ◽  
Better Than

This research addressed the job-shop scheduling problem in a manufacturing company. The objective is to minimize the makespan. Constraint programming approach is developed to solve the problem. The result obtained from constraint programming is better than that of currently applied by the company. The constraint programming approach is also tested on several randomly generated instances.

A Constraint-Based Approach for Skilled Workforce Scheduling Problem

2014 ◽  
Vol 631-632 ◽  
pp. 1295-1299
Author(s):  
Yan Li ◽  
Zhi Run Xiao ◽  
Wen Qing Dou ◽  
Ying Yang
Keyword(s):  
Constraint Programming ◽  
Project Scheduling ◽  
Complex Problem ◽  
Programming Approach ◽  
Scheduling Problem ◽  
Workforce Scheduling ◽  
Resource Assignment ◽  
Scheduling Model ◽  
Project Scheduling Problem ◽  
Skilled Workforce

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.

Sign in / Sign up

Export Citation Format

Share Document