4,727 Hits in 10.1 sec

Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem

Sophie Demassey, Christian Artigues, Philippe Michelon
2005 INFORMS journal on computing  
W e propose a cooperation method between constraint programming and integer programming to compute lower bounds for the resource-constrained project scheduling problem (RCPSP).  ...  The originality of our approach is to use additionally some deductions performed by constraint propagation, and particularly by the shaving technique, to derive new cutting planes that strengthen the linear  ...  Introduction The resource-constrained project scheduling problem (RCPSP) is one of the most general scheduling problems that is extensively studied in the literature (Brucker et al. 1999) .  ... 
doi:10.1287/ijoc.1030.0043 fatcat:dy4abm2n5bcbtatytuktu7n2y4

An application of constraint programming and Boolean satisfiability solving techniques to variants of the resource-constrained project scheduling problem

Alexander Schnell
2015 unpublished
In the scientific literature, this issue is known as the resource-constraint project scheduling problem (RCPSP).  ...  In practice, project managers are confronted with the problem of assigning starting times to a number of precedence-related project milestones (activities), so that a certain project deadline is respected  ...  Introduction The aim of resource-constrained project scheduling (RCPS) is to assign starting times to a number of jobs subject to precedence and resource constraints such that a project related objective  ... 
doi:10.25365/thesis.37627 fatcat:pjrevj3kzjakdl6rwrjwoq2fsm

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes

Janniele A.S. Araujo, Haroldo G. Santos, Bernard Gendron, Sanjay Dominik Jena, Samuel S. Brito, Danilo S. Souza
2019 Computers & Operations Research  
Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known NP-hard combinatorial optimization problems.  ...  In this paper, we propose a cutting plane algorithm to separate five different cut families, as well as a new preprocessing routine to strengthen resource-related constraints.  ...  The authors thank UFOP, CNPq (student with scholarship -Brazil), FAPEMIG, and Compute Canada for supporting this research.  ... 
doi:10.1016/j.cor.2019.104782 fatcat:dedizrs27vdl3molrmbomdwflm

Resource Sharing via Planed Relay for

Chong Shen, Susan Rea, Dirk Pesch
2008 EURASIP Journal on Advances in Signal Processing  
To address cross-layer network layers routing issues, the cascaded ADCR establishes routing paths across MTs, RNs, and cellular base stations (BSs) and provides appropriate quality of service (QoS).  ...  In rural places such as mountain areas, an MT may also communicate with the core network, when intermediate MTs act as relay node with mobility.  ...  To effectively manage problems stated above, we propose to combine the advantages of different networks so that the Mobile Terminal (MT) can utilise an optimised MANET, the base-station-oriented network  ... 
doi:10.1155/2008/793126 fatcat:iheleeijgvchdimdtzo7kt74zi

The Programmable Data Plane

Oliver Michel, Roberto Bifulco, Gábor Rétvári, Stefan Schmid
2021 ACM Computing Surveys  
Programmable data plane technologies enable the systematic reconfiguration of the low-level processing steps applied to network packets and are key drivers toward realizing the next generation of network  ...  services and applications.  ...  Acknowledgments The research leading to these results has received funding from the European Union's H2020 Framework Programme (H2020-EU.2.1.1) under grant agreement n. 101017171 (Project "Marsal") and  ... 
doi:10.1145/3447868 fatcat:hafeovivhfgmpecqzrinsbfmnq

Page 9738 of Mathematical Reviews Vol. , Issue 2003m [page]

2003 Mathematical Reviews  
The last chapters are devoted to the description of complete scheduling algorithms and computational results for job-shop, open-shop, and resource-constrained project scheduling, where there exist precedences  ...  (As an aside to the non-constraint programmer: the purpose of propagation of a constraint is to compute better upper and lower bounds on the problem variables knowing only the constraint and the variables  ... 

Project Scheduling-Theory and Practice

Willy Herroelen
2009 Production and operations management  
The project scheduling problem involves the scheduling of project activities subject to precedence and/or resource constraints.  ...  The objective of this paper is to confront project scheduling theory with project scheduling practice.  ...  Results obtained on the KSD-instances with 30, 60, 90 and 120 activities (Kolisch et al. (1995) ) show that generating cutting planes based on deductions performed by constraint propagation can be an alternative  ... 
doi:10.1111/j.1937-5956.2005.tb00230.x fatcat:bx5sotfrivelhlmmm5f7h532lq

A review of methods and algorithms for optimizing construction scheduling

J Zhou, P E D Love, X Wang, K L Teo, Z Irani
2013 Journal of the Operational Research Society  
The application of these methods to various scheduling problems is discussed and implications for future research are identified.  ...  Optimizing construction project scheduling has received a considerable amount of attention over the past 20 years.  ...  A PSO-based approach was proposed to solve the resource constrained project scheduling problem with the objective of minimizing the project duration.  ... 
doi:10.1057/jors.2012.174 fatcat:ylm5whuvvra7pdoa5zj6uecgry

Building Industrial Applications with Constraint Programming [chapter]

Helmut Simonis
2001 Lecture Notes in Computer Science  
It is a typical example of a semi-process industry scheduling problem with constraints due to limited storage capacity at all levels. • The FORWARD-C system is used in 5 oil refineries world-wide for shortand  ...  In this chapter 1 we will give an overview of real-life applications developed with constraint logic programming.  ...  Acknowledgments This overview would not have been possible without the work of the team at COSYTEC together withtheir customers and partners in different projects.  ... 
doi:10.1007/3-540-45406-3_6 fatcat:6kxkykmxqneg5iyt6qgxg65ic4

Improving branch and bound for Jobshop scheduling with constraint propagation [chapter]

Yves Caseau, François Laburthe
1996 Lecture Notes in Computer Science  
very quick to compute and which outperform by far lower bounds given by cutting planes.  ...  In this paper, we refine the propagation scheme and describe in detail the branch&bound algorithm with its heuristics and we compare constraint programming to integer programming.  ...  Last, we are grateful to Jacques Carlier and Eric Pinson for an enlightning conversation about disjunctive scheduling.  ... 
doi:10.1007/3-540-61576-8_79 fatcat:h7pa2lvesvezjdpjnamigvrbbq

Digital enterprise solution for integrated production planning and control

L. Monostori, G. Erdős, B. Kádár, T. Kis, A. Kovács, A. Pfeiffer, J. Váncza
2010 Computers in industry (Print)  
The methods are illustrated by describing two prototype systems and by some experimental results obtained in an industry initiated project.  ...  Digital enterprise technologies combined with sophisticated optimization algorithms can significantly contribute to the efficiency of production.  ...  Acknowledgements We dedicate this paper to the memory of the late András Márkus who contributed many ideas presented here.  ... 
doi:10.1016/j.compind.2009.10.008 fatcat:dm5xf2wdd5cxzetpe2uditgqte

A Survey on Data Plane Programming with P4: Fundamentals, Advances, and Applied Research [article]

Frederik Hauser, Marco Häberle, Daniel Merling, Steffen Lindner, Vladimir Gurevich, Florian Zeiger, Reinhard Frank, Michael Menth
2021 arXiv   pre-print
Programmable data planes allow users to define their own data plane algorithms for network devices including appropriate data plane application programming interfaces (APIs) which may be leveraged by user-defined  ...  In the first part of this paper we give a tutorial of data plane programming models, the P4 programming language, architectures, compilers, targets, and data plane APIs.  ...  Tofino Traffic Manager supports both storeand-forward as well as the cut-through mode, up to 32 queues per port, precise traffic shaping and multiple scheduling disciplines.  ... 
arXiv:2101.10632v3 fatcat:ci4hkca5ibdzpatgowhzqcqzvm

Logic, Optimization, and Constraint Programming

John N. Hooker
2002 INFORMS journal on computing  
It traces the history of logic-based methods in optimization and the development of constraint programming in artificial intelligence.  ...  (Optimization, Constraint programming, Logic-based methods, Artificial Intelligence)  ...  Production scheduling applications include scheduling with resource constraints (Pinto and Grossmann 1997) and with labor resource constraints in particular (Heipcke 1999) , twostage process scheduling  ... 
doi:10.1287/ijoc. fatcat:22kiqfcqqvfcppogsgbd5xqj2y

Scheduling jobs sharing multiple resources under uncertainty: A stochastic programming approach

Brian Keller, GÜzİn Bayraksan
2009 IIE Transactions  
We develop an exact solution method based on Benders decomposition for problems with a moderate number of scenarios.  ...  Potential applications of this model include team scheduling problems that arise in service industries such as engineering consulting and operating room scheduling.  ...  Acknowledgments We thank the referees for their insightful comments and Ken Baker for valuable input on an earlier version of this paper.  ... 
doi:10.1080/07408170902942683 fatcat:exz2dnh4svfhvpknwm4ut6wpsm

A Hybrid Exact Algorithm for the TSPTW

Filippo Focacci, Andrea Lodi, Michela Milano
2002 INFORMS journal on computing  
(Routing; Scheduling; Relaxations; Cutting Planes; Constraint Programming) methods such as branch-and-cut (Applegate et al. 1998) and local search (Johnson and McGeoch 1997).  ...  The solution of scheduling problems is probably one of the most promising Constraint Programming (CP) area of application to date (see, e.g., Baptiste et al. 1995 , Caseau and Laburthe 1994 , 1996 .  ...  Acknowledgments We are grateful to Matteo Fischetti for suggesting the Lagrangean Relaxation technique, and for many fruitful discussions.  ... 
doi:10.1287/ijoc.14.4.403.2827 fatcat:lzttebmarrg5tclg2tcafv7nwu
« Previous Showing results 1 — 15 out of 4,727 results