950 resultados para Expatriate Assignment


Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a single machine due date assignment and scheduling problem of minimizing holding costs with no tardy jobs tinder series parallel and somewhat wider class of precedence constraints as well as the properties of series-parallel graphs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Single machine scheduling problems are considered, in which the processing of jobs depend on positions of the jobs in a schedule and the due-dates are assigned either according to the CON rule (a due-date common to all jobs is chosen) or according to the SLK rule (the due-dates are computed by increasing the actual processing times of each job by a slack, common to all jobs). Polynomial-time dynamic programming algorithms are proposed for the problems with the objective functions that include the cost of assigning the due-dates, the total cost of disgarded jobs (which are not scheduled) and, possibly, the total earliness of the scheduled jobs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper is concerned with several of the most important aspects of Competence-Based Learning (CBL): course authoring, assignments, and categorization of learning content. The latter is part of the so-called Bologna Process (BP) and can effectively be supported by integrating knowledge resources like, e.g., standardized skill and competence taxonomies into the target implementation approach, aiming at making effective use of an open integration architecture while fostering the interoperability of hybrid knowledge-based e-learning solutions. Modern scenarios ask for interoperable software solutions to seamlessly integrate existing e-learning infrastructures and legacy tools with innovative technologies while being cognitively efficient to handle. In this way, prospective users are enabled to use them without learning overheads. At the same time, methods of Learning Design (LD) in combination with CBL are getting more and more important for production and maintenance of easy to facilitate solutions. We present our approach of developing a competence-based course-authoring and assignment support software. It is bridging the gaps between contemporary Learning Management Systems (LMS) and established legacy learning infrastructures by embedding existing resources via Learning Tools Interoperability (LTI). Furthermore, the underlying conceptual architecture for this integration approach will be explained. In addition, a competence management structure based on knowledge technologies supporting standardized skill and competence taxonomies will be introduced. The overall goal is to develop a software solution which will not only flawlessly merge into a legacy platform and several other learning environments, but also remain intuitively usable. As a proof of concept, the so-called platform independent conceptual architecture model will be validated by a concrete use case scenario.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The free-base form of tetra-tert-butyl porphine (TtBP), which has extremely bulky meso substituents, is severely distorted from planarity, with a ruffling angle of 65.5degrees. The resonance Raman spectrum of TtBP (lambda(ex) = 457.9 nm) and its d(2), d(8), and d(10) isotopomers have been recorded, and while the spectra show high-frequency bands similar to those observed for planar meso-substituted porphyrins, there are several additional intense bands in the low-frequency region. Density functional calculations at the B3-LYP/6-31G(d) level were carried out for all four isotopomers, and calculated frequencies were scaled using a single factor of 0.98. The single factor scaling approach was validated on free base porphine where the RMS error was found to be 14.9 cm(-1). All the assigned bands in the high-frequency (> 1000 cm(-1)) region of TtBP were found to be due to vibrations similar in character to the in-plane skeletal modes of conventional planar porphyrins. In the low-frequency region, two of the bands, assigned as nu(8) (ca. 330 cm(-1)) and nu(16) (ca. 540 cm(-1)), are also found in planar porphyrins such as tetra-phenyl porphine (TPP) and tetra-iso-propyl porphine (IPP). Of the remaining three very strong bands, the lowest frequency band was assigned as gamma(12) (pyr swivel, obsd 415 cm(-1), calcd 407 cm(-1) in do). The next band, observed at 589 cm-1 in the do compound (calcd 583 cm(-1)), was assigned as a mode whose composition is a mixture of modes that were previously labeled gamma(13) (gamma(CmCaHmCa)) andy gamma(11) (pyr fold(asym)) in NiOEP. The final strong band, observed at 744 cm(-1) (calcd 746 cm(-1)), was assigned to a mode whose composition is again a mixture of gamma(11) and gamma(13), although here it is gamma(11) rather than gamma(13) which predominates. These bands have characters and positions similar to those of three of the four porphyrin ring-based, weak bands that have previously been observed for NiTPP. In addition there are several weaker bands in the TtBP spectra that are also

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A combination method of ozonolysis and chiral stationary phase (CSP)-GC-MS analysis has been developed to determine the enantiopurity values and absolute configurations of a range of alkaloid and coumarin hemiterpenoids derived from C- and O-prenyl epoxides.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Incidence calculus is a mechanism for probabilistic reasoning in which sets of possible worlds, called incidences, are associated with axioms, and probabilities are then associated with these sets. Inference rules are used to deduce bounds on the incidence of formulae which are not axioms, and bounds for the probability of such a formula can then be obtained. In practice an assignment of probabilities directly to axioms may be given, and it is then necessary to find an assignment of incidence which will reproduce these probabilities. We show that this task of assigning incidences can be viewed as a tree searching problem, and two techniques for performing this research are discussed. One of these is a new proposal involving a depth first search, while the other incorporates a random element. A Prolog implementation of these methods has been developed. The two approaches are compared for efficiency and the significance of their results are discussed. Finally we discuss a new proposal for applying techniques from linear programming to incidence calculus.