September 2009
Systems Science;2009, Vol. 35 Issue 3, p31
Academic Journal
Scheduling of multi-robot and a multi-product job shop treated as a multi-criteria (time and money) allocation problem of shared renewable and non-renewable resources is considered. Specified in terms of sets of decision variables, their domains and sets of constraints, i.e., as a constraint satisfaction problem, the multi-robot system scheduling can be directly implemented and resolved in constraint programming environment. Both accurate and uncertain decision variables are taken into account. In that context the proposed approach to constraints compression can be seen as paper's main contribution. The concept proposed enables us to improve the searching strategy by decreasing the number of backtrackings. Its implementation is illustrated by two kinds of problems corresponding to standard, routine-like questions: "what implies the conclusion?" and "what follows from premises?", consequently.


Related Articles

  • Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models. Po-Chieng Hu // International Journal of Advanced Manufacturing Technology;Mar2004, Vol. 23 Issue 5/6, p383 

    The worker assignment scheduling problem involves both the decisions of job scheduling and worker assignment. In this research, only the performance measure of total tardiness is investigated in the model of identical parallel machines with nonpreemptive jobs. Since the worker assignment...

  • Combining Constraint Programming and Local Search for Job-Shop Scheduling.  // INFORMS Journal on Computing;Winter2011, Vol. 23 Issue 1, p1 

    No abstract available.

  • SCHEDULING FLEXIBLE JOB-SHOPS:: A WORST CASE ANALYSIS AND AN EVOLUTIONARY ALGORITHM. Kacem, Imed // International Journal of Computational Intelligence & Applicatio;Dec2003, Vol. 3 Issue 4, p437 

    In this paper, we deal with the flexible job shop scheduling problem. We propose an efficient heuristic method for solving the assignment problem. Indeed, we propose a worst case analysis to evaluate the performance of such a heuristic. The second specificity of the problem studied is the...

  • Parallel branch-and-bound methods for the job-shop scheduling problem. Perregaard, Michael; Clausen, Jens // Annals of Operations Research;1998, Vol. 83 Issue 1-4, p137 

    Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions...

  • Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Neumann, Klaus; Zimmermann, Jürgen // Central European Journal of Operations Research;Dec2002, Vol. 10 Issue 4, p357 

    This paper is concerned with resource-constrained project scheduling problems where cash flows are associated with project activities and the net present value of the project is to be maximized. The temporal constraints between the activities are given by minimum and maximum time lags. First we...

  • A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model. Ahuja, Ravindra K.; Goodstein, Jon; Mukherjee, Amit; Orlin, James B.; Sharma, Dushyant // INFORMS Journal on Computing;Summer2007, Vol. 19 Issue 3, p416 

    The fleet-assignment model (FAM) for an airline assigns fleet types to the set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. A through connection at a station is a connection between an arrival flight and a departure flight at the station, both...

  • On the Efficiency of Feasible Solutions of a Multicriteria Assignment Problem. Bufardi, Ahmed // Open Operational Research Journal;2008, Vol. 2, p25 

    The particular structure of the assignment problem made of it a very popular subject of study and an important research tool in operations research and management science. In addition to the importance that the assignment problem represents in its own, it can appear as a relaxation of more...

  • Global propagation of side constraints for solving over-constrained problems. Petit, Thierry; Poder, Emmanuel // Annals of Operations Research;Apr2011, Vol. 184 Issue 1, p295 

    This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These side constraints control how the initial constraints of the model should be satisfied or violated, to obtain...

  • From enterprise models to scheduling models: bridging the gap. Bart�k, Roman; Little, James; Manzano, Oscar; Sheahan, Con // Journal of Intelligent Manufacturing;Feb2010, Vol. 21 Issue 1, p121 

    Enterprise models cover all aspects of modern enterprises, from accounting, through management of custom orders and invoicing, to operational data such as records on machines and workers. In other words, all data necessary for running the company are available in enterprise models. However,...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics