proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

the conventional method towards deriving schedule for a fleet of ships to minimize cost alone has the short-coming of not addressing the problem of operation revenue losses associated with delays during maintenance at ships dockyards. in this paper, a preventive maintenance schedule for a fleet of ships that incorporates op-portunity cost is presented. the idea is to assign a penalty cost to al...

data grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. the heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. most existing scheduling algorithms in grids only focus on one kind of grid jobs which can be data...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum av...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...