This paper considers the minimization of makespan in unrelated parallel batch processing machines scheduling problem with considering non-identical job size and dynamic ready time. The considered have different capacity speed. Each machine processes a number jobs as at same time so that machine’s is not exceeded. are equal to largest batch, respectively. In this paper, Mixed Integer Linear Prog...

In this paper, we provide a new class of randomized approximation algorithms for scheduling problems by directly interpreting solutions to so-called time-indexed LPs as probabilities. The most general model we consider is scheduling unrelated parallel machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. The crucial idea for these multi...

In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results than the traditional SA and developed an effective heuristic for the problem: Squeaky Wheel Optimiz...

We consider scheduling on identical and unrelated parallel machines with job assignment restrictions. These problems are NP-hard and they do not admit polynomial time approximation algorithms with approximation ratios smaller than 1.5 unless P=NP. However, if we impose limitations on the set of machines that can process a job, the problem sometimes becomes easier in the sense that algorithms wi...

We consider the problem of scheduling unrelated parallel machines so as to minimize the total weighted completion time of jobs. Whereas the best previously known approximation algorithms for this problem are based on LP relaxations, we give a 2 –approximation algorithm that relies on a convex quadratic programming relaxation. For the special case of two machines we present a further improvement...

scheduling has become an attractive area for artificial intelligence researchers. on other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. a maintenance program may be considered as the heath care of manufacturing machines and equip...