نتایج جستجو برای: machine scheduling

تعداد نتایج: 325168  

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

Journal: :journal of optimization in industrial engineering 2010
mehrzad abdi khalife babak abbasi amirhossein kamali dolat abadi

in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

2007
Maria Italia Gualtieri Giuseppe Paletta

A new constructive heuristic for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is described. The proposed algorithm, which is an n logn algorithm as the LPT algorithm of Graham, iteratively combines partial solutions that are obtained by partitioning the set of jobs in suitable families of subsets. The algorithm was tested using di...

Journal: :Computing and Informatics 2016
Peng Xiao Dongbo Liu

Conventional utilization-based power model is effective for measuring the power consumption of physical machines. However, in virtualized environments its accuracy cannot be guaranteed because of the recursive resource accessing among multiple virtual machines. In this paper, we present a novel virtual machine scheduling algorithm, which uses Performance-Monitor-Counter as heuristic information...

1993
Paul Mireault Rakesh Vohra James B. Orlin Rakesh V. Vohra

We consider the problem of minimizing the makespan when scheduling tasks on two uniform parallel machines, where one machine is q times as efficient on each task as is the other. We compute the maximum relative error of the LPT (largest processing time first) heuristic as a function of q. In the special case that the two machines are identical (q = 1), our problem and heuristic are identical to...

2007
Peter Brucker Mikhail Y. Kovalyov

The problem of scheduling G groups of jobs on m unrelated parallel machines is considered. Each group consists of several identical jobs. Implicit in a schedule is a partition of a group into batches; all jobs of a batch are processed jointly. It is possible for diierent batches of the same group to be processed concurrently on diierent machines. However, at any time, a batch can be processed o...

1999
Christophe Lizzi

We present a scheduling architecture that enables the implementation of deadline-based scheduling policies. The architecture is used to give real-time capabilities to a custom Java virtual machine. This framework retains a clear separation between generic kernel mechanisms and upper level scheduling classes. A pure earliest deadline first algorithm can be implemented, but enhanced policies such...

Journal: :European Journal of Operational Research 2012
Sindhura Balireddi Nelson A. Uhan

We investigate cost-sharing mechanisms for scheduling cost-sharing games. We assume that the demand is general—that is, each player can be allocated one of several levels of service. We show how to design mechanisms for these games that are weakly group strategyproof, approximately budget-balanced, and approximately efficient, using approximation algorithms for the underlying scheduling problem...

2013
Van Huy Nguyen Nguyen Huynh Tuong Hua Phung Nguyen Thanh Hien Nguyen

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computati...

2002
C. A. Silva

This paper introduces a new approach for decentralized scheduling in a parallel machine environment based on the ant colonies optimization algorithm. The algorithm extends the use of the traveling salesman problem for scheduling in one single machine, to a multiple machine problem. The results are presented using simple and illustrative examples, and show that the algorithm is able to optimize ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید