This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.

In this work we present a mechanism designed for the selection of a suitable set of social norms that would regulate a simulated virtual society. The approach taken for this selection problem is a combination of Genetic algorithms and Simulation. A resource-gathering society has been built using Repast, and on top of it, the genetic algorithm that finds the social norms.

This paper presents an approach for automatically validating candidate hierarchical relations extracted from parallel enumerative structures. It relies on the discursive properties of these structures and on the combination of resources of different nature, a semantic network and a distributional resource. The results show an accuracy of between 0.50 and 0.67, with a gain of 0.11 when combining...

We identify three foundational tasks for clients interacting with Web services, and study how to realise these tasks using major paradigms (WS-*, Semantic Web Services, RESTful APIs and Linked APIs). We identify relative merits of each approach and point out how the combination of resource-oriented services with Linked Data can enable an interoperable ecosystem of Web services.

Hume is a programming language targeted at safety-critical, resource-bounded systems. Bounded time and space usage is achieved by a clear separation of coordination and computation in the design of the language. However, there is no correctness verification. Such verification is imperative in safety-critical environments. It is our contention that the language design makes a combination of dedu...

This paper gives an overview of a new approach to Resource Constrained Project Scheduling. The approach is based on the combination of a novel optimization technique with limited discrepancy search, and generates the best known solutions to benchmark problems of realistic size and character.

In this paper we describe a static analyser for Java bytecode which uses a combination of amortised analysis and Separation Logic due to Robert Atkey. With the help of Java annotations we are able to give precise resource utilisation constraints for Java methods which manipulate various heapbased data structures.

abstract introduction & objective: enuresis is defined as involuntary voiding. it is a socially disruptive and stressful condition which affects around 15% of five years old children and up to 1% of adults. aim the aim of this study was to assess the efficacy of desmopressin (nasal spray) and oxybutinin combination therapy in treatment of patients with primary nocturnal enuresis that were resis...

in this paper, based on the background of cost-oriented assembly line balancing problems, a novel mathematical model for scheduling and balancing the assembly line is offered that with the combination of task sequence-dependent setup time, parallel stations and resource constraint, minimizes the operational and investment costs of assembly system. due to the complexity of the problem, the equat...