The presence of symmetry is common in certain types of scheduling problems. Symmetry can occur when one is scheduling a collection of jobs on multiple identical machines, or if one is determining production schedules for identical machines. General symmetry-breaking methods can be strengthened by taking advantage of the special structure of the symmetry group in scheduling problems. In this pap...

This work addresses opportunistic distributed multiuser scheduling in the presence of a fixed packet deadline delay constraint. A threshold-based scheduling scheme is proposed which uses the instantaneous channel gain and buffering time of the individual packets to schedule a group of users simultaneously in order to minimize the average system energy consumption while fulfilling the deadline d...

We present Group Ratio Round-Robin (GR), the first proportional share scheduler that combines accurate proportional fairness scheduling behavior with O(1) scheduling overhead on both uniprocessor and multiprocessor systems. GR uses a simple grouping strategy to organize clients into groups of similar processor allocations which can be more easily scheduled. Using this strategy, GR combines the ...

Supply Chain Management (SCM) plans and controls the production over a group of autonomous enterprises. Process-oriented design is used to eliminate inefficiencies of the chain on a strategic level. This Virtual Enterprise (VE) must also manage and optimize the collaborative production on a tactical and operative level. Production planning, scheduling, and control are thus important functions f...

Commonly used scheduling algorithms in high-level synthesis are not capable of sharing resources across process boundaries. This results in the usage of at least one resource per operation type and process. A new method is proposed in order to overcome these restrictions and to share high-cost or limited resources within a process group. This allows the use of less than one resource per operati...

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

Energy consumption in commercial and educational buildings is impacted by group activities such as meetings, workshops, classes and exams, and can be reduced by scheduling these activities to take place at times and locations that are favorable from an energy standpoint. This paper improves on the effectiveness of energy-aware room-booking and occupancy scheduling approaches, by allowing the sc...