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 
RECENT RESULTS ON STABILITY ANALYSIS ...
By: Yuri Sotskov (4338 reads)
Rating: (1.00/10)

Abstract: Two assembly line balancing problems are addressed. The first problem (called SALBP-1) is to minimize number of linearly ordered stations for processing n partially ordered operations V = {1, 2, ..., n} within the fixed cycle time c. The second problem (called SALBP-2) is to minimize cycle time for processing partially ordered operations V on the fixed set of m linearly ordered stations. The processing time ti of each operation i ∈V is known before solving problems SALBP-1 and SALBP-2. However, during the life cycle of the assembly line the values ti are definitely fixed only for the subset of automated operations V\V~ . Another subset V~ ⊆V includes manual operations, for which it is impossible to fix exact processing times during the whole life cycle of the assembly line. If j ∈V~, then operation times tj can differ for different cycles of the production process. For the optimal line balance b of the assembly line with operation times t1, t2, …, tn, we investigate stability of its optimality with respect to possible variations of the processing times tj of the manual operations j ∈V~.

Keywords: Scheduling, robustness and sensitivity analysis, assembly line.

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

Link:

RECENT RESULTS ON STABILITY ANALYSIS OF AN OPTIMAL ASSEMBLY LINE BALANCE

Yuri Sotskov

http://www.foibg.com/ijita/vol14/ijita14-2-p11.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.34 ]
Powered by Tikiwiki CMS/Groupware