Distributed scheduling using simple learning machines
Article Abstract:
A game-theoretic approach was created to resolve the problem of scheduling tasks of a parallel program into parallel system's processors. The approach, with the use of learning machines, is specifically designed to formulate parallel and distributed algorithms of scheduling tasks in parallel computers. Implementation of the approach showed its ability in producing an algorithm that is capable of generating a schedule very rapidly.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Minimizing the number of vehicles in periodic scheduling: the non-Euclidean case
Article Abstract:
A scheduling problem was presented in which the constraint lies in lessening the number of vehicles needed to satisfy a fixed periodically repeating group of tasks. Specifically, presentation of the problem aims to determine the least length cycle-cover in a graph. The scheduling problem can be reduced to assignment problem whenever the set-up times meets the triangle inequality.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
Article Abstract:
A polynomial algorithm was developed to address a two-machine no-wait job-shop scheduling problem. The algorithm aims to lessen the mean flow time on two machines, which process scheduled jobs, by creating an optimal schedule. The polynomial algorithm showed that scheduling problem becomes NP-hard if zero processing time operations are permitted.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method. One-machine job scheduling with non-constant capacity - minimizing weighted completion times
- Abstracts: Tet spending spree wanes. Artists examine ravages of economic crisis. Nation seeks to help itself with new Yen loans; plans for $5.1 billion in aid to region are part of Tokyo's efforts toward a symbiotic recovery
- Abstracts: Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method. part 2
- Abstracts: Why is Hong Kong faltering? Danger lurks on both sides of the border, requiring eternal vigilance. Quest to succeed Cambodia's Sihanouk intensifies
- Abstracts: Single-machine scheduling with time windows and earliness/tardiness penalties. On the complexity of two-machine flowshop problems with due date related objectives