NDLI: Stochastic and distributed anytime task scheduling

Content Provider	IEEE Xplore Digital Library
Author	Charpillet, F. Chades, I. Gallone, J.-M.
Copyright Year	1998
Description	Author affiliation: Inst. Nat. de Recherche en Inf. et Autom., Vandoeuvre-les-Nancy, France (Charpillet, F.)
Abstract	Scheduling techniques have been intensively studied by several research communities and have been applied to a wide range of applications in computer and manufacturing environments. Most of the scheduling problems are NP-hard. Therefore, heuristics and approximation algorithms must be used for large problems. Obviously these methods are of interest when they provide near optimal solutions and when computational complexity can be controlled. For this purpose, we have developed a method based on the Hopfield neural network model. This approach permits us to solve in an iterative way a scheduling problem, finding a solution through the minimization of an energy function. An interesting property of this approach is its capacity to trade-off the quality for computation time. Indeed, the convergence speed of the minimization process can be tuned by adapting several parameters that influence the quality of the results. By tuning these parameters, we can build a library of a set of run-time executions (contracts) of the Hopfield minimization process with different characteristics (quality, efficiency). We present two applications exploiting the advantage of having available anytime contract algorithms. The first application illustrates how to build a solution of a one machine scheduling problem within a delay that follows a stochastic distribution. The second application deals with unrelated parallel machine scheduling of non preemptive tasks.
Starting Page	280
Ending Page	287
File Size	693473
Page Count	8
File Format	PDF
ISBN	0780352149
ISSN	10823409
DOI	10.1109/TAI.1998.744855
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-11-10
Publisher Place	Taiwan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Stochastic processes Job shop scheduling Processor scheduling Computer aided manufacturing Contracts Application software Computer applications Approximation algorithms Heuristic algorithms Iterative algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Anytime scheduling with neural networks

A stochastic strategy for solving job shop scheduling problem

A genetic algorithm for multilayer multiprocessor task scheduling

Bottleneck-based heuristic for re-entrant flow shop with two potential dominant machines

An evolutionary approach to the job-shop scheduling problem

Approximation algorithms for the job interval selection problem and related scheduling problems

Algorithm comparison for manufacturing scheduling problems

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

Extending the Palmer algorithm to solve group flexible flow-shop problems

Stochastic and distributed anytime task scheduling

Similar Documents

Anytime scheduling with neural networks

A stochastic strategy for solving job shop scheduling problem

A genetic algorithm for multilayer multiprocessor task scheduling

Bottleneck-based heuristic for re-entrant flow shop with two potential dominant machines

An evolutionary approach to the job-shop scheduling problem

Approximation algorithms for the job interval selection problem and related scheduling problems

Algorithm comparison for manufacturing scheduling problems

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

Extending the Palmer algorithm to solve group flexible flow-shop problems

Stochastic and distributed anytime task scheduling