We consider the multi organization scheduling problem (MOSP) [19]: given N organizations owning, each of them, one set tasks and machines, aim is to compute a schedule which gathers all on such that makespan minimized. A rationality constraint must be fulfilled: no should increase its (the completion time last task) compared case where it schedules own (and only tasks) machines. show cooperatio...

We consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity results. Particu...

We consider two generalizations of the proportionate flow shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our first (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the characteristic value of the machine. We show that the...

Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...

We present a technique for generalizing previously known results for single resource task systems to multiresource malleable task systems: Assuming a system with s resources, we apply a transformation which maps the system into a single resource task system. For a large class of heuristics it is shown, that given a heuristic H which achieves a suboptimality bound of c H with respect to the opti...

In this paper, we consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity r...

Planning as satisfiability, represented by SATPlan, can find plans with the shortest makespan for classical planning. However, it has been deemed a limitation of SAT-based approaches for delivering optimality regarding metrics other than the makespan. Our Plan-A solver uses the SAT-based framework to find plans with minimal total action costs. The idea is to optimally solve SAT instances based ...

Let J = {j1, j2, . . . jn} be a set of n jobs such that each job, ji, has its own processing time ti. Let M = {M1,M2, . . .Mm} be a set of machines. Let A(i) denote the set of jobs assigned to machine Mi, and let T (i) = ∑ j∈A(i) tj. Define the “makespan”, MS, as maxi T (i). In general, the goal of load balancing is to find a schedule that minimizes the “makespan”. A schedule in this case is so...

We consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all jobs) among the set of schedules with optimal makespan (the completion time of the latest job). Utilizing an existing optimization algorithm for the minimization of makespan, we propose an algorith...