in this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). no set-up is necessary between jobs belonging to the same family. a set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...

background and objectives: operating room (or) scheduling is key to optimal operating room productivity. the significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. this paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. the model considers various surgical operation co...

task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...

scheduling is an important subject of production and operations management area. in flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. the concept of transportation time is very important in scheduling. transportation can be done by robots. in situations that robots are used to transpor...

preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...

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 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...

one of the main features of high throughput computing systems is the availability of high power processing resources. cloud computing systems can offer these features through concepts like pay-per-use and quality of service (qos) over the internet. many applications in cloud computing are represented by workflows. quality of service is one of the most important challenges in the context of sche...

priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. the discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. on the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....