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
  • Articles  (5)
  • scheduling  (5)
  • Springer  (5)
  • 2020-2024
  • 1995-1999  (1)
  • 1985-1989  (4)
  • 1980-1984
  • 1975-1979
  • 1925-1929
  • 2022
  • 1995  (1)
  • 1987
  • 1985  (4)
  • 1980
  • 1977
  • 1976
  • Economics  (5)
  • 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
    Scheduling of project networks (1985)
    Springer
    Annals of operations research 4 (1985), S. 227-252 
    Details
    ISSN: 1572-9338
    Keywords: Distance matrix ; earliest start scheduling ; feasible partial orders ; Graham anomalies ; project networks ; regular cost functions ; resource constrained project networks ; scheduling ; stochastic scheduling problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper deals with the network optimization problem of minimizing regular project cost subject to an arbitrary precedence relation on the sets of activities and to arbitrarily many resource constraints. The treatment is done via a purely structural approach that considerably extends the disjunctive graph concept. It is based on so-called feasible posets and includes a quite deep and useful representation theorem. This theorem permits many insights concerning the analytical behaviour of the optimal value function, the description and counting of all essentially different optimization problems, the nature of Graham anomalies, connections with the on-line stochastic generalizations, and several others. In addition, it also allows the design of a quite powerful class of branch-and-bound algorithms for such problems, which is based on an iterative construction of feasible posets. Using so-called distance matrices, this approach permits the restriction of the exponential part of the algorithm to the often comparatively small set of ‘resource and cost essential’ jobs. The paper reports on computational experience with this algorithm for examples from the building industry and includes a rough comparison with the integer programming approach by Talbot and Patterson.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02022042
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A new branching strategy for time constrained routing problems with application to backhauling (1995)
    Springer
    Annals of operations research 61 (1995), S. 91-109 
    Details
    ISSN: 1572-9338
    Keywords: Routing ; scheduling ; time windows ; backhauling ; column generation ; branch-and-bound ; 90B05 ; 90C06 ; 90C08 ; 90C10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time windows. This strategy involves branching on resource variables (time or capacity) rather than on network flow variables. We also examine criteria for selecting network nodes for branching. To test the effectiveness of the branching strategy, we conduct computational experiments on time window constrained vehicle routing problems where backhauling is permitted only after all the shipments to clients have been made. The branching method proved very effective. In cases where time was the more binding constraint, time-based branching succeeded in decreasing the number of nodes explored by two thirds and the total computation time by more than half when compared to flow-based branching. The computational results also show that the overall algorithm was successful in optimally solving problems with up to 100 customers. It produced an average cost decrease of almost 7% when backhauling was permitted as compared to the cost involved when the client and the distributor routes were distinct.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02098283
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Analysis of flexible manufacturing systems with priority scheduling: PMVA (1985)
    Springer
    Annals of operations research 3 (1985), S. 113-139 
    Details
    ISSN: 1572-9338
    Keywords: FMS ; scheduling ; mean value analysis ; HOL ; performance analysis ; queueing networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A new methodology for performance analysis of flexible manufacturing systems (FMSs) with priority scheduling is presented. The analytic model developed extends the mean value analysis of closed networks of queues with multiple product types, various non-preemptive priority service disciplines, and with parallel machine stations. Performance measures derived include the expected throughput per product and per station, utilization of machines and transporters, queuing times and queue length measures for various configurations. Extensive numerical calculations have shown that the algorithm used for solving the problem converges rapidly and retains numerical stability for large models. The paper also illustrates the application of the model to a system with a mixture of FCFS and HOL disciplines which gives insights into various priority assignment policies in FMSs. Special attention was given to the problem of scheduling the robot carriers (transporters).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02024742
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Interactive optimization (1985)
    Springer
    Annals of operations research 5 (1985), S. 539-556 
    Details
    ISSN: 1572-9338
    Keywords: Programming ; interactive algorithms ; graphics ; scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Optimization algorithms or heuristics in which the user interacts significantly either during the solution process or as part of post-optimality analysis are becoming increasingly popular. An important underlying premise of such man/machine systems is that there are some steps in solving a problem in which the computer has an advantage and other steps in which a human has an advantage. This paper first discusses how man/machine systems can be useful in facilitating model specification and revision, coping with aspects of a problem that are difficult to quantify and assisting in the solution process. We then survey successful systems that have been developed in the areas of vehicle scheduling, location problems, job shop scheduling, course scheduling, and planning language-based optimization.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02023610
    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...