ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Books
  • Articles  (3)
  • manufacturing systems  (2)
  • algorithm
  • 2020-2022
  • 1985-1989  (3)
  • 1970-1974
  • 1950-1954
  • 1945-1949
  • 1985  (3)
  • Economics  (3)
Collection
  • Books
  • Articles  (3)
Source
Keywords
Publisher
Years
  • 2020-2022
  • 1985-1989  (3)
  • 1970-1974
  • 1950-1954
  • 1945-1949
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Experimental investigation of real-time scheduling in flexible manufacturing systems (1985)
    Springer
    Annals of operations research 3 (1985), S. 355-377 
    Details
    ISSN: 1572-9338
    Keywords: Flexible manufacturing systems ; scheduling ; manufacturing systems ; simulation ; computer integrated manufacturing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper presents a new two-phase (TP) approximate method for real-time scheduling in a flexible manufacturing system (FMS). This method combines a reduced enumeration schedule generation algorithm with a 0–1 optimization algorithm. In order to make the combined algorithm practicable, heuristic rules are introduced for the selection of jobs to be scheduled. The relative performance of the TP method vis-a-vis conventional heuristic dispatching rules such as SPT, LPT, FCFS, MWKR, and LWKR is investigated using combined process-interaction/discrete-event simulation models. An efficient experimental procedure is designed and implemented using these models, and the statistical analysis of the results is presented. For the particular case investigated, the conclusions are very encouraging. In terms of mean flow time, the TP method performs significantly better than any other tested heuristic dispatching rules. Also, the experimental results show that using global information significantly improves the FMS performance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023749
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Numerical performance of approximate queuing formulae with application to flexible manufacturing systems (1985)
    Springer
    Annals of operations research 3 (1985), S. 141-152 
    Details
    ISSN: 1572-9338
    Keywords: Automated manufacturing ; computerized manufacturing ; flexible manufacturing systems ; manufacturing systems ; measures of congestion ; queuing formulae
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper calls attention to two of the more successful queuing approximation formulae — one by Kramer and one by Marchal. The analytic solution of a range of single server Erlang cases is compared to the two approximation formulae. Then a family of H2/M/1 cases is similarly considered. Maximum errors are seen to be about three percent. The Kramer formula seems to be better when the interarrival coefficient of variation is less than 0.66 and the Marchal formula is better for larger interarrival coefficients of variation. Finally, a multiserver refinement function (the ratio of G/G/1 results to M/M/1 results) is proposed to scale M/M/s as an approximation for G/G/s. In most of these multiple channel cases, the maximum error is less than six percent. The last section of this paper presents a simple, representative FMS. It is modelled as an open queuing network. Then the approximation procedure is applied node by node to illustrate the estimation of system performance measures such as machine utilizations and throughput.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02024743
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    An optimal minimax algorithm (1985)
    Springer
    Annals of operations research 4 (1985), S. 103-121 
    Details
    ISSN: 1572-9338
    Keywords: Minimax ; games ; strategy ; matrix ; chess ; algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Computer game-playing programs repeatedly calculate minimax elements μ = min i max j M ij of large pay off matricesM ij . A straightforwardrow-by-row calculation of μ scans rows ofM ij one at a time, skipping to a new row whenever an element is encountered that exceeds a current minimax. Anoptimal calculation, derived here, scans the matrix more erratically but finds μ after testing the fewest possible matrix elements. Minimizing the number of elements tested is reasonable when elements must be computed as needed by evaluating future game positions. This paper obtains the expected number of tests required when the elements are independent, identically distributed, random variables. For matrices 50 by 50 or smaller, the expected number of tests required by the row-by-row calculation can be at most 42% greater than the number for the optimal calculation. When the numbersR, C of rows and columns are very large, both calculations require an expected number of tests nearRC/InR.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02022038
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...