Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau
Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposed into two subproblems—sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an executable schedule from the semi-schedule via idle-time insertion. Sequencing is strongly NP-hard in general. Although timetabling is polynomial-time solvable, it can become a computational bottleneck if the procedure is executed many times within a larger framework. This paper makes two contributions. We …
Dynamic Energy Aware Task Scheduling Using Run-Queue Peek, Sachin Pawaskar, Hesham Ali
Dynamic Energy Aware Task Scheduling Using Run-Queue Peek, Sachin Pawaskar, Hesham Ali
Computer Science Faculty Proceedings & Presentations
Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy consideration. A number of heuristics have been developed for this consideration. In this paper, we study the scheduling problem for a particular battery model. In the proposed work, we show how to enhance a well know approach of accounting for …