Solving large scheduling problems by minimizing conflict

Publisher Website
Google Scholar
Abstract
The scheduling of tasks (such as jobs through a com puter, different pulses through a radar system, or machining efforts through a production line) is a problem that is encountered quite frequently in practice. Traditionally, analysts have endeavored to develop schedules that minimize make-span (the time that elapses between the start of the first task in a sequence until the finish of the last task in a sequence). However, there are often many other appropriate measures of scheduling effectiveness. In this paper we address the problem of maximizing the number of jobs completed in an environment where each job is in competition with other jobs for certain scarce resources. Further, we shall assume that the number of jobs and possible start times is so large as to eliminate the possibility of the use of any exact technqiue.

This publication has 0 references indexed in Scilit: