The paper describes an experiment of answer set planning in biochemical pathway planning. The focus is on large planning problem instances. It is shown that well-known planning techniques, such as planning graph analysis, landmarks recognition, and planning using landmarks are useful in answer set planning and can be easily incorporated in an answer set planning system.

in this paper, a multi-period and multi-resource operating room (or) scheduling and rescheduling problem with elective and semi-elective (semi-urgent) patients is addressed. a scheduling-rescheduling framework based on the so-called rolling horizon approach is proposed to solve the problem. the core of the proposed framework is a novel proposed mixed-integer linear programming (milp) model with...

demand management is one of the main subjects in marketing which affects the operations performance of an organization considerably. in the classic production planning approach, demand is considered as an exogenous factor in planning, while in the new approach, it is a factor that can be controlled. in this paper, we focus on a new approach in supply chain planning and present an integrated pro...

This paper presents a technique for encoding the representation of a constrained planning problem through the generation of an equivalent unconstrained planning problem. In many real situations the initial state/goals characterization of a planning problem is not satisfactory, this motivates the notion of a constrained planning problem, i.e. a planning problem for which the user speciies additi...

This paper presents PORSCE II, an integrated system that performs automatic semantic web service composition through planning. In order to achieve that, an essential step is the translation of the web service composition problem into a planning problem. The planning problem is then solved using external domain-independent planning systems, and the solutions are visualized and evaluated. The sys...

The inventory routing problem involves trading off inventory holding costs at client locations with vehicle routing costs to deliver frequently from a single central depot to meet deterministic client demands over a finite planing horizon. In this paper, we consider periodic solutions that visit clients in one of several specified frequencies, and focus on the case when the frequencies of visit...

this paper focuses on formulating capacity-price trade off problem in yield management for manufactur-ing industry by drawing motivation from the remarkable success of yield management (ym) implementation in airlines. in the current practice, there is no alternative and procedure for the manufacturer, as well as cus-tomers to take advantage of using the unfulfilled capacity in discounted offers...

AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as input. However, building action models from scratch is a difficult and time-consuming task, even for experts. In this paper, we develop an algorithm called ARMS (action-relation modelling system) for automatically discoveri...

This paper presents a study on the transfer of learned control knowledge between two different planning techniques. We automatically learn heuristics (usually, in planning, heuristics are also named control knowledge) from one planner search process and apply them to a different planner. The goal is to improve this second planner efficiency solving new problems, i.e. to reduce computer resource...