منابع مشابه
Optimization Models for Scheduling of Jobs
This work is motivated by a particular scheduling problem that is faced by logistics centers that perform aircraft maintenance and modification. Here we concentrate on a single facility (hangar) which is equipped with several work stations (bays). Specifically, a number of jobs have already been scheduled for processing at the facility; the starting times, durations, and work station assignment...
متن کاملScheduling Adaptively Parallel Jobs Scheduling Adaptively Parallel Jobs
An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...
متن کاملRobust Optimization Models for Volunteer Scheduling
In this age of hyper competition, firms need to create and sustain a competitive advantage. To achieve this, firm’s need to constantly focus on the identification of differential product strategies, building or reshaping core competencies, acquiring unique technologies and accumulation of intellectual property all of which can all be harnessed to make the company successful in a highly competit...
متن کاملA Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs
Moldable job scheduling has been proved to be effective compared to traditionaljob scheduling policies. It is based on the observation that most jobs submitted to a spaceshared parallel system can actually reduce their response times if they were allowed to take any number of processors in a user-specified range. Previous approaches to scheduling of moldable jobs focused on when and how to choo...
متن کاملScheduling Jobs Before Shut -
Distributed systems execute background or alternative jobs while waiting for data or requests to arrive from another processor. In those cases, the following shut-down scheduling problem arises: given a set of jobs of known processing time, schedule them on m machines so as to maximize the total weight of jobs completed before an initially unknown deadline. We will present optimally competitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Research of the National Institute of Standards and Technology
سال: 2006
ISSN: 1044-677X
DOI: 10.6028/jres.111.009