The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitor...

Generation or transmission maintenance scheduling packages provide preventive or corrective maintenance scheduling over a certain period in order to minimize system costs while fulfilling relative requirements. In advanced power systems inclusion of network constraints and increasing rate of electricity demand may result in higher number of generators and transmission lines and hence lower syst...

Setup costs are a crucial factor in many branches of industry and frequently sequence dependent. However, the empirical acquisition of setup costs is inaccurate and not practicable for companies with large product portfolios operating in volatile markets. We therefore propose an abstract model for the estimation of such sequence dependent setup costs and subsequently apply dispatching and sched...

In this paper, we address the problem of two-machine flowshop scheduling problem with sequence independent setup times to minimize the total completion time. We propose five new polynomial lower bounds. Computational results based on randomly generated data show that our proposed lower bounds consistently outperform those of the literature.

The major problem of wind turbines is the great variability of wind power production. The dynamic change of the wind speed returns the quantity of the power injected to networks. Therefore, wind–thermal generation scheduling problem plays a key role to implement clean power producers in a competitive environment. In deregulated power systems, the scheduling problem has various objectives than i...

processor, making the scheduler partition-aware can lead to inter-core locality benefits for other structures as well. For example, in Delaunay mesh generation, this data-centric scheduling policy ensures that different cores work on triangles from different partitions of the mesh, reducing data contention and the likelihood of speculation conflicts. It is not clear that data-centric scheduling...

This paper exploits the interactions between the machine scheduling and the scheduling of Material Handling System in a given Flexible Manufacturing System (FMS) layout with an objective of minimization of makespan and to study the overall feasibility of generation of optimal simultaneous schedules. A heuristic scheduling algorithm is developed which takes into account both machine and vehicle ...

The use of order statistics to arrive at a scheduling regime is shown to be applicable to data farms running on second generation parallel processors Uniform and decreasing task size scheduling regimes are examined Experimental timings and a further simula tion for large scale e ects were used to exercise the scheduling regimes The paper also considers a number of other scheduling schemes for d...