REDOM: an OO language to define and on-line manipulate regulations in the resource (re)scheduling problem

Thrampoulidis, K.; Διαμαντόπουλος, Νικόλαος; Housos, Efthymios

doi:10.1002/(sici)1097-024x(199710)27:10<1135::aid-spe121>3.0.co;2-t

Cited by 4 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work, we have designed a high level domain specific language, ARUS, to be used for specifying the feasibility and cost calculations in airline crew pairing. The language has its syntactic features inherited from DRL [8]. ARUS specializes DRL in a domain specific manner.…”

Section: Resultsmentioning

confidence: 99%

“…Another system that uses a similar modeling language is DAYSY (Day-to-Day Resource Management Systems) rule handling system [5,6]. This system defines a high-level object-oriented generic language DRL (DAYSY Rule Language) [7,8] that can be used by different application domains for resource management systems.…”

Section: : a Small Flight Networkmentioning

confidence: 99%

“…In this work, we introduce a high level language ARUS (Algopt RUle Specification language) [9] for modeling the feasibility/cost calculation rules for airline crew pairing problem. We use the general structure of the generic rule modeling language introduced in [8] and augment this language with new expressions and modifications according to the airline crew pairing problem. By using ARUS, users can define the hierarchical activity structure used in airline domain and can associate feasibility rules and cost calculation methods for each activity type.…”

Section: : a Small Flight Networkmentioning

confidence: 99%

See 2 more Smart Citations

High Level Rule Modeling Language for Airline Crew Pairing

Mutlu¹,

Birbil²,

Bülbül³

et al. 2011

AIP Conference Proceedings

View full text Add to dashboard Cite

The crew pairing problem is an airline optimization problem where a set of least costly pairings (consecutive flights to be flown by a single crew) that covers every flight in a given flight network is sought. A pairing is defined by using a very complex set of feasibility rules imposed by international and national regulatory agencies, and also by the airline itself. The cost of a pairing is also defined by using complicated rules. When an optimization engine generates a sequence of flights from a given flight network, it has to check all these feasibility rules to ensure whether the sequence forms a valid pairing. Likewise, the engine needs to calculate the cost of the pairing by using certain rules. However, the rules used for checking the feasibility and calculating the costs are usually not static. Furthermore, the airline companies carry out what-if-type analyses through testing several alternate scenarios in each planning period. Therefore, embedding the implementation of feasibility checking and cost calculation rules into the source code of the optimization engine is not a practical approach. In this work, a high level language called ARUS is introduced for describing the feasibility and cost calculation rules. A compiler for ARUS is also implemented in this work to generate a dynamic link library to be used by crew pairing optimization engines.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: : a Small Flight Networkmentioning

confidence: 99%

Section: : a Small Flight Networkmentioning

confidence: 99%

See 1 more Smart Citation

High Level Rule Modeling Language for Airline Crew Pairing

Mutlu¹,

Birbil²,

Bülbül³

et al. 2011

AIP Conference Proceedings

View full text Add to dashboard Cite

show abstract

“…Since scheduling rules are continuously changing due to the dynamic nature of the competitive business environment, there is a need for a high-level domain-specific language in order to express and manage these rules. Domain-specific component instances that implement these rules in SchedSP are generated using a high-level domain-specific language [40]. To enable common representation, the development of a generic legality system was required.…”

Section: Legality and Attribute Evaluatormentioning

confidence: 99%

SchedSP: a Grid-based application service provider of scheduling solutions

Goulas

Alefragis

Housos

2005

Softw: Pract. Exper.

Self Cite

View full text Add to dashboard Cite

In this paper, SchedSP, a middleware framework for providing scheduling solutions as services over the Internet, is presented. Emphasis is given on creating a reusable framework that facilitates the development of specialized clients for the input, output and control interfaces of the various scheduling applications. SchedSP manages the task of preparing and running the required processes and allows the application interface developer to focus on the functionality and efficiency of the interface. The Internet-based scheduling applications created are competitive in all aspects with traditional locally executed applications. In this paper, detailed architecture and implementation details of the SchedSP framework prototype are presented. In addition, the methodology for creating specific case studies based on the SchedSP middleware framework is presented. 1196G. GOULAS, P. ALEFRAGIS AND E. HOUSOS investing in hardware, software and human resources. The ASP offers applications over the Internet for use on its computational resources using a flexible licensing, credit and/or payment scheme. One goal of the ASP approach is to narrow the software requirements on the client side to a Web browser. Such software can be considered as a universal feature, since it is installed automatically in all modern desktop operating systems.In this paper, SchedSP, an Application Service Provision software framework that supports the development of scheduling solutions, is presented. Given the computational requirements of scheduling applications, SchedSP assumes that Grid resources provided by a Computational Infrastructure Service Provider (CISP) are used [1]. An important design goal of SchedSP is to allow favourable scaling on the number of concurrent users and allow for the efficient creation and support of new scheduling applications. The modular design of the SchedSP architecture provides support for the creation, storage and modification of input and output data on the server side. The application interfaces built on top of SchedSP are such that the input and output information can be visualized in a manner similar to the traditional use of a scheduling application on a local computer system. SchedSP also incorporates a set of generic scheduling related components in order to assist the application developers in the creation of their scheduling systems.The initial motivation for SchedSP was to provide the scheduling applications, which have been developed over the years in the Computer Systems Laboratory of the University of Patras, as application services over the Internet. These applications cover problems from several scheduling domains including university timetabling [2], high-school timetabling [3-5], personnel scheduling [6], bus driver scheduling [7], and airline crew scheduling [8][9][10][11].Several published papers discuss various methodologies for the organization and architecture of a service-provisioning framework. In Vinci [12], a service-oriented architecture for supporting the development of Web applications is...

show abstract