Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > F. Theory of Computation  > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY  > F.2.2 Nonnumerical Algorithms and Problems 
SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES ...
By: Yuri Sotskov, Natalja Egorova (3956 reads)
Rating: (1.00/10)

Abstract: We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such a variable between the given lower and upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n = |J| of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total flow time is used for sequencing the jobs from such a subset. The computational experiments for randomly generated single-machine scheduling problems with n ≤ 700 show that the developed dominance relations are quite helpful in minimizing the weighted total flow time of n jobs with uncertain processing times.

Keywords: Scheduling, robustness and sensitivity analysis.

ACM Classification Keywords: F.2.2 Nonnumerical algorithms and problems: Sequencing and scheduling.

Link:

SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES AND MINIMIZING THE WEIGHTED TOTAL FLOW TIME

Yuri Sotskov, Natalja Egorova

http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p12.pdf

Print
F.2.2 Nonnumerical Algorithms and Problems
article: CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES · LINEAR PROGRAM FORM FOR RAY DIFFERENT DISCRETE TOMOGRAPHY · CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS · IMPLEMENTATION OF DICTIONARY LOOKUP AUTOMATA FOR UNL ANALYSIS AND GENERATION · APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)-MATRICES WITH DIFFERE · SELF-MODIFICATED PREDICATE NETWORKS · THE INVERSE MASLOV METHOD AND ANT TACTICS FOR EXHAUSTIVE SEARCH DECREASING · CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1 · CONSTRUCTION OF CLASS LEVEL DESCRIPTION FOR EFFICIENT RECOGNITION OF ... · EFFICIENT SIMULATION FOR PROLOG IMPLEMENTATION OF IMAGE RECOGNITION PROBLEM · THE INVERSE METHOD FOR SOLVING ARTIFICIAL INTELLIGENCE PROBLEMS IN ... · EVALUATION OF GREEDY ALGORITHM OF CONSTRUCTING (0,1)-MATRICES WITH DIFFERENT ... · DISCRETE ARTIFICIAL INTELLIGENCE PROBLEMS AND NUMBER OF STEPS OF THEIR SOLUTION · ON STRUCTURAL RECOGNITION WITH LOGIC AND DISCRETE ANALYSIS · SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES ... · REALIZATION OF AN OPTIMAL SCHEDULE FOR THE TWO-MACHINE · RECENT RESULTS ON STABILITY ANALYSIS ... · LEARNING TECHNOLOGY IN SCHEDULING BASED ON THE MIXED GRAPHS ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.54MB ]   [ GZIP Disabled ]   [ Server load: 0.30 ]
Powered by Tikiwiki CMS/Groupware