Filters








4,537 Hits in 6.3 sec

Constraint satisfaction techniques in planning and scheduling

Roman Barták, Miguel A. Salido, Francesca Rossi
2008 Journal of Intelligent Manufacturing  
solving real life planning and scheduling problems.  ...  Over the last few years constraint satisfaction, planning, and scheduling have received increased attention, and substantial effort has been invested in exploiting constraint satisfaction techniques when  ...  This section gave some examples and techniques of using constraint satisfaction for solving scheduling problems.  ... 
doi:10.1007/s10845-008-0203-4 fatcat:eqp4tuysnreobdlgwuqzsa263m

New trends in constraint satisfaction, planning, and scheduling: a survey

Roman Barták, Miguel A. Salido, Francesca Rossi
2010 Knowledge engineering review (Print)  
In this section we present some examples of constraint models for finding plans. and some examples and techniques of using constraint satisfaction for solving scheduling problems.  ...  Once the problem is modeled as a CSP, there exist many constraint satisfaction techniques to solve it. Generally, a problem can be formulated in many different manners, even in natural language.  ...  In general, solving temporal constraint problems is difficult.  ... 
doi:10.1017/s0269888910000202 fatcat:4n7bn7rnyjbifi3nkignhwe5uy

DÉJÀ VU — A reusable framework for the construction of intelligent interactive schedulers [chapter]

Jürgen Dorn, Mario Girsch, Nikos Vidakis
1998 Advances in Production Management Systems  
We describe the techniques of the DÉJÀ VU Scheduling Class Library to achieve a library of reusable and extendible classes for the construction of interactive scheduling systems.  ...  We describe abstract scheduling objects, constraints between them, and potential user interactions with the system. A first scheduling system was developed for the steel plant of Böhler Kapfenberg.  ...  Mixed-initiative scheduling is a paradigm that solves this problem best.  ... 
doi:10.1007/978-0-387-35304-3_41 fatcat:vgxdg76gjjeqdm2ypk4prj6hvy

Emergent constraint satisfaction through multi-agent coordinated interaction [chapter]

JyiShane Liu, Katia Sycara
1995 Lecture Notes in Computer Science  
We have applied the methodology to job shop scheduling, an NP-complete constraint satisfaction problem.  ...  Experimental results on a benchmark suite of problems show that CP&CR outperformed three other state-of-the-art scheduling techniques, in both efficiency and number of problems solved.  ...  The dominant constraints in job shop scheduling are temporal activity precedence and resource capacity constraints.  ... 
doi:10.1007/bfb0027059 fatcat:44awcwp3jnflbiwlk576wfosii

Towards Reusable Intelligent Scheduling Software [chapter]

Jürgen Dorn
1999 Lecture Notes in Computer Science  
Production scheduling plays a key enabling technique in improving the efficiency of modern production enterprises facing the international competition.  ...  In this paper a special architecture based on object-oriented application frameworks and AI-reasoning methods is proposed as a mean to narrow this gap.  ...  Different schedule types should be distinguished to reflect different problem types. In scheduling theory (e.g. French 1982) job-shop and flow-shop scheduling are differentiated.  ... 
doi:10.1007/10703016_6 fatcat:l5mdynn6evbgvlstlfyer7mm64

Distributed manufacturing scheduling using intelligent agents

Weiming Shen
2002 IEEE Intelligent Systems  
Unforeseen dynamic situations In a job shop manufacturing environment, things rarely go as expected. Scheduled jobs get canceled and new jobs are inserted.  ...  For example, a classical job shop scheduling problem with n jobs, m machines, and k operators could have ((n!) m ) k possible solutions.  ...  Methodologies and techniques CORTES used microopportunistic techniques to solve the scheduling problem through a two-agent system, where each agent schedules a set of jobs and monitors a set of resources  ... 
doi:10.1109/5254.988492 fatcat:df4gvk6tmfcnpocj6nzgqhtnsm

Agent-Based Modeling: Methods and Techniques for Scheduling Industrial Machine Operation

Chiagunye Tochukwu, Inyiama Hyacinth, Aguodoh Patrick C.
2017 International Journal of Trend in Scientific Research and Development  
A combination of Markov Chain instruments and agent oriented analysis is used in the analysis of the proposed agent based model (ABM) for the job shop scheduling problem.  ...  Owing to its impact on the industrial economy, job shop scheduler and controller are vital algorithms for modern manufacturing processes.  ...  temporal constraints and resource constraints are satisfied  ... 
doi:10.31142/ijtsrd7018 fatcat:sra4vpz5qnb2xjrbjk7dmmhqdu

Cooperating scheduling systems

Jurgen Dorn
2001 International Journal of Manufacturing Technology and Management (IJMTM)  
Here, a scheduling system of the steel making shop and that of the rolling mill try to optimize the global costs by optimizing their own schedules under the observation of the other systems constraints  ...  . in 1989 for a thesis on reactive robot planning.  ...  Especially this complexity demands a distributed problem solving method as proposed in the following.  ... 
doi:10.1504/ijmtm.2001.001430 fatcat:eioelsanhnbwhjbxqszcgyyhsm

Genetic Algorithms — Constraint Logic Programming. Hybrid Method for Job Shop Scheduling [chapter]

K. Mesghouni, P. Pesin, S. Hammadi, C. Tahon, P. Borne
1997 Re-engineering for Sustainable Industrial Production  
So this paper shows the cooperation of two methods for the solving of job shop scheduling problems; Genetic Algorithms (GAs) and Constraint Logic Programming (CLP).  ...  The job-shop scheduling problem is one of hardest problem (NP-complete problem).  ...  job-shop scheduling problem; we proceed in two steps.  ... 
doi:10.1007/978-0-387-35086-8_12 fatcat:uks5bs5ppfgdrgk2ecjkxjrbfu

Scheduling a Single Robot in a Job-Shop Environment through Precedence Constraint Posting [chapter]

D. Díaz, M. D. R-Moreno, A. Cesta, A. Oddi, R. Rasconi
2011 Lecture Notes in Computer Science  
We have defined a simple robotic scenario, reduced it to a known scheduling problem which is addressed here with a constraint-based, resource-driven reasoner.  ...  The paper presents recent work on using robust state-of-the-art AI Planning and Scheduling (P&S) techniques to provide autonomous capabilities in a space robotic domain.  ...  Conclusions In this paper we have studied the use of existing constraint-based, heuristic-biased techniques to solve the problem of "scheduling a robot in a job-shop environment".  ... 
doi:10.1007/978-3-642-21827-9_22 fatcat:q5vabrj54ndjbdy5l6di7bbply

Fuzzy constraints in job-shop scheduling

Didier Dubois, H�l�ne Fargier, Henri Prade
1995 Journal of Intelligent Manufacturing  
This paper proposes an extension of the constraint-based approach to job-shop scheduling, that accounts for the flexibility of temporal constraints and the uncertainty of operation durations.  ...  The paper formulates a simple mathematical model of jobshop scheduling under preference and uncertainty, relating it to the formal framework of constraint-satisfaction problems in Artificial Intelligence  ...  Solving flexible job-shop scheduling problems The solving approach consists in searching for a sequencing of operations on each machine (like in most approaches), from which earliest and latest starting  ... 
doi:10.1007/bf00128646 fatcat:atgn4icnmrfsrlclbirpuionem

An Optimal Constraint Programming Approach to the Open-Shop Problem

Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau
2012 INFORMS journal on computing  
This paper presents an optimal constraint programming approach for the Open-Shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics  ...  The Constraint Programming Model Constraint programming techniques have been widely used to solve scheduling problems.  ...  Introduction Open-Shop problems are at the core of many scheduling problems involving unary resources such as Job-Shop or Flow-Shop problems, which have received an important amount of attention because  ... 
doi:10.1287/ijoc.1100.0446 fatcat:2pmrbph7yrhvhisztgg2fcftta

Case-based reactive scheduling [chapter]

Jürgen Dorn
1995 IFIP Advances in Information and Communication Technology  
Old solutions stored in a case base are used to solve new problems.  ...  In this paper case-based reasoning is applied to reactive scheduling to model the experience of skilled human operators in reacting to unforeseen events in the production process.  ...  In this case, the problem can be solved with similar techniques to the original problem -a combinatorial search for a solution.  ... 
doi:10.1007/978-0-387-34928-2_4 fatcat:bzystsmt7bcclcgzycxm73utpa

Knowledge-based production management approaches, results and prospects

STEPHEN F. SMITH
1992 Production planning & control (Print)  
Among the paradigms for knowledge-based production management considered are rule-based scheduling, simulation-based scheduling, constraint-based scheduling, fuzzy scheduling, planning and scheduling,  ...  In others, novel concepts and techniques have been developed that offer new opportunities for more cost-effective factory performance.  ...  Another approach to fuzzy job shop scheduling, similarly based on fuzzy temporal constraint management techniques, is described in [37] .  ... 
doi:10.1080/09537289208919407 fatcat:ndhjsluefrd6lhvuetepxo6e44

A Declarative Framework for Constrained Search Problems in Manufacturing [chapter]

Sitek Pawek, Wikarek Jaroslaw
2008 Automation and Robotics  
Constrained search problems Constrained search problems (e.g., scheduling, planning, resource allocation, placement, routing) appear frequently at different levels of decision in manufacturing.  ...  Unlike traditional approaches, CLP provides for a natural representation of heterogeneous constraints and allows domain-specific heuristics to be used on top of generic solving techniques.  ...  In constraint programming approach to decision support in scheduling problems, the problem to be solved is represented in terms of decision variables and constraints on these variables (Pape, 1995) .  ... 
doi:10.5772/6107 fatcat:h2skdpbe2vbpnpsjrhnas6ghgq
« Previous Showing results 1 — 15 out of 4,537 results