Traditional research on machine scheduling focuses on job allocation and sequencing to optimize certain objective functions that are defined in job completion times. With regard to environmental concerns, energy consumption becomes another critical concern in high-performance systems. In this paper, we address the scheduling problem in a multiple machine system where the computing speeds of the...

This paper investigates three scheduling algorithms and three inventory control policies to evaluate their effect on the system performance measures using computer simulation. The model chosen is a flow-shop type, computer assembly plant. Analysis is conducted on two scheduling measures (summation of process time and tardiness) and two inventory control measures (ordering cost and holding cost)...

This paper focuses on the problem of scheduling a set of independent jobs with setup times and job splitting, on a set of identical parallel machines such that total tardiness is minimized. In this study, it is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. Because the problem is NP-hard, a memetic algorithm (MA) is proposed...

The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an attractive choice for scheduling soft-real-time systems on multiprocessors. Previous work has demonstrated that the maximum tardiness is bounded, and has derived formulas for computing tardiness bounds, in EDF-schedule...

In this paper we describe a simplified way to implement performance control in a multi-tier computing system designed for e-commerce applications. We show that the simpler SISO (Single Input Single Output) controller, rather than a more complex distributed or centralized MIMO (Multiple Input Multiple Output) controller, works well, regardless of the presence of multiple cluster nodes and multip...

Traditional machining economics looks into the optimal set of machining conditions under which the production cost or time per part is minimized. No due dates are included in the consideration. Job sequencing searches for the optimal order of jobs so that lateness and/or earliness is minimized. The optimization assumes that processing times are fixed. In practice, processing times are variable ...

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...

ANDREAS BALLOT*, LOTHAR KRIENITZ, KIPLAGAT KOTUT, CLAUDIA WIEGAND, JAMES S. METCALF, GEOFFREY A. CODD AND STEPHAN PFLUGMACHER LEIBNIZ-INSTITUTE OF FRESHWATER ECOLOGY AND INLAND FISHERIES, DEPARTMENT OF LIMNOLOGY OF STRATIFIED LAKES, ALTE FISCHERHÜTTE 2, D-16775 STECHLIN, GERMANY, KENYATTA UNIVERSITY, BOTANY DEPARTMENT, PO BOX 43844, NAIROBI, KENYA, 2 LEIBNIZ-INSTITUTE OF FRESHWATER ECOLOGY AND ...

We consider the problem of minimizing general delay costs on unrelated machines. In this problem, we are given a set of m machines and a set of n jobs. Each job j has a machine dependent processing time of pij on machine i, and a release time rij . Further, we are also given a non-decreasing function fj(t) which gives the cost of completing the job j at time t. Our goal is to assign each job to...