This paper is focused on the allocation of vacant jobs to job seekers from a demand side perspective by studying the recruitment behaviour of employers. A model is developed to analyze the role of search and selection methods of employers as determinants of the re-employment probabilities of the unemployed. In an empirical application for the Dutch labour market, we have examined the effect of ...

In this study, we evaluate the use of radio-frequency identification (RFID) technology for improving remanufacturing efficiency. We report the results of discrete-event simulation model that analyzes how RFID creates value within the remanufacturing operation. We find that the simulated gains from using RFID are quite modest, and propose alternative justifications for the major benefits seen in...

Combinatorial optimization problems are often used to test heuris-tics. Among heuristics, stochastic ones deserve particular consideration being generally meta-heuristics that aim at performing reasonnably well on a wide spectrum of problems. Among them, evolutionary algorithms have recently appeared. Emphasis have been put on them by researches that have shown that they are able to solve eecie...

This paper reports an ongoing project of applying CSP algorithms CDGT and CDBT to solving job shop scheduling problems with non-relaxable time windows. A simpliied job shop scheduling task is presented to illustrate the procedure where the given task is converted into a CSP and the synthesis algorithm CDGT is combined with the search algorithm CDBT to nd a feasible or the optimal schedule. The ...

We present a new approach to monitoring of the execution process of an application job in the GRID environment. The main point of the approach is use of GRID services to access monitoring information with the security level available in GRID.

This paper presents a simulated annealing search procedure developed to solve job shop scheduling problems simultaneously subject to tardiness and inventory costs. The procedure is shown to signi cantly increase schedule quality compared to multiple combinations of dispatch rules and release policies, though at the expense of intense computational e orts. A meta-heuristic procedure is developed...

ASAP is a system for enabling distributed analysis for CMS physicists. It was created with the aim of simplifying the transition from a locally running application to one that is distributed across the Grid. The experience gained in operating the system for the past two years has been used to redevelop a more robust, performant and scalable version. ASAP consists of a client for job creation, c...

PvmJobs is a general bag-of-jobs library for PVM that works with any user created job structure in a master/slave paradigm. A master can spawn slave processes, schedule and dispatch jobs to slaves, coordinate and synchronize the activities. A slave process obtains a job from the master, performs a set of prescribed tasks, returns results to the master, and obtains the next job. Slaves are organ...