An integrated distributed learning environment (IDLE) is proposed based on two designing frameworks: learning activities and instructional strategies. The proposed IDLE consists of four components: (1) online courseware, (2) virtual classroom, (3) instructional management, and (4) tools. In addition to system components, the installation of two types of instructional personnel is also suggested...

This paper addresses scheduling n jobs in a two-machine flow shop to minimize the total completion time, subject to the condition that the jobs are processed in the same given sequence on both machines. A new concept of optimal schedule block is introduced, and polynomial time dynamic programming algorithms employing this concept are derived for two specific problems. In the first problem, the ...

Even a fully loaded computer system, where the bottleneck resource is constantly busy, often has some idle capacities available on other resources. This proposal argues for using these idle capacities speculatively, increasing system performance for correct predictions. In such a system, all resources will ideally be constantly loaded with either regular foreground tasks, or speculative idle-ti...

This paper addresses the problem of optimally inserting idle time into a single-machine schedule when the sequence is fixed and the cost of each job is a convex function of its completion time. We propose a pseudo-polynomial time algorithm to find a solution within some tolerance of optimality in the solution space. The proposed algorithm generalises several previous works related to the subject.

In this paper, we present a deterministic permutation flowshop scheduling problem with new objective function, the total core idle time. The interest of is related to reduce energy consumption system, taking into account that needed during processing times constant, and machines are switched off front back times. Therefore, dependent on time where in stand-by mode, i.e between jobs, named as Co...