for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> PHYSICS (Total: 767 journals)
    - ELECTRICITY AND MAGNETISM (8 journals)
    - MECHANICS (20 journals)
    - NUCLEAR PHYSICS (44 journals)
    - OPTICS (91 journals)
    - PHYSICS (557 journals)
    - SOUND (18 journals)
    - THERMODYNAMICS (29 journals)

PHYSICS (557 journals)            First | 1 2 3 4 5 6 | Last

Differential Equations and Nonlinear Mechanics     Open Access   (Followers: 4)
Doklady Physics     Hybrid Journal   (Followers: 1)
Dynamical Properties of Solids     Full-text available via subscription  
ECS Journal of Solid State Science and Technology     Full-text available via subscription   (Followers: 1)
Egyptian Journal of Remote Sensing and Space Science     Open Access   (Followers: 5)
EJNMMI Physics     Open Access  
Embedded Systems Letters, IEEE     Hybrid Journal   (Followers: 20)
Energy Procedia     Open Access   (Followers: 3)
Engineering Failure Analysis     Hybrid Journal   (Followers: 32)
Engineering Fracture Mechanics     Hybrid Journal   (Followers: 18)
Environmental Fluid Mechanics     Hybrid Journal   (Followers: 2)
EPJ Nonlinear Biomedical Physics     Open Access  
EPJ Quantum Technology     Open Access  
EPJ Techniques and Instrumentation     Full-text available via subscription  
EPJ Web of Conferences     Open Access  
European Journal of Physics     Full-text available via subscription   (Followers: 5)
European Journal of Physics Education     Open Access   (Followers: 5)
European Physical Journal - Applied Physics     Full-text available via subscription   (Followers: 5)
European Physical Journal C     Hybrid Journal  
Europhysics News     Open Access   (Followers: 1)
Experimental Mechanics     Hybrid Journal   (Followers: 16)
Experimental Methods in the Physical Sciences     Full-text available via subscription  
Experimental Techniques     Hybrid Journal   (Followers: 35)
Exploration Geophysics     Hybrid Journal   (Followers: 3)
Few-Body Systems     Hybrid Journal  
Fire and Materials     Hybrid Journal   (Followers: 5)
Flexible Services and Manufacturing Journal     Hybrid Journal   (Followers: 1)
Fluctuation and Noise Letters     Hybrid Journal   (Followers: 1)
Fluid Dynamics     Hybrid Journal   (Followers: 5)
Fortschritte der Physik/Progress of Physics     Hybrid Journal  
Frontiers in Physics     Open Access   (Followers: 2)
Frontiers of Materials Science     Hybrid Journal   (Followers: 4)
Frontiers of Physics     Hybrid Journal   (Followers: 1)
Fusion Engineering and Design     Hybrid Journal   (Followers: 9)
Geochemistry, Geophysics, Geosystems     Full-text available via subscription   (Followers: 22)
Geografiska Annaler, Series A: Physical Geography     Hybrid Journal   (Followers: 3)
Geophysical Research Letters     Full-text available via subscription   (Followers: 50)
Geoscience and Remote Sensing, IEEE Transactions on     Hybrid Journal   (Followers: 21)
Glass Physics and Chemistry     Hybrid Journal   (Followers: 2)
Granular Matter     Hybrid Journal   (Followers: 2)
Graphs and Combinatorics     Hybrid Journal   (Followers: 7)
Gravitation and Cosmology     Hybrid Journal  
Handbook of Geophysical Exploration: Seismic Exploration     Full-text available via subscription  
Handbook of Metal Physics     Full-text available via subscription  
Handbook of Surface Science     Full-text available via subscription   (Followers: 3)
Handbook of Thermal Analysis and Calorimetry     Full-text available via subscription  
Haptics, IEEE Transactions on     Hybrid Journal   (Followers: 4)
Heat Transfer - Asian Research     Hybrid Journal   (Followers: 8)
High Energy Density Physics     Hybrid Journal   (Followers: 1)
High Pressure Research: An International Journal     Hybrid Journal   (Followers: 1)
IEEE Journal of Quantum Electronics     Hybrid Journal   (Followers: 15)
IEEE Signal Processing Magazine     Full-text available via subscription   (Followers: 32)
IET Optoelectronics     Hybrid Journal   (Followers: 3)
Il Colle di Galileo     Open Access  
Indian Journal of Biochemistry and Biophysics (IJBB)     Open Access   (Followers: 4)
Indian Journal of Physics     Hybrid Journal   (Followers: 4)
Indian Journal of Pure & Applied Physics (IJPAP)     Open Access   (Followers: 8)
Indian Journal of Radio & Space Physics (IJRSP)     Open Access   (Followers: 6)
Industrial Electronics, IEEE Transactions on     Hybrid Journal   (Followers: 12)
Industry Applications, IEEE Transactions on     Hybrid Journal   (Followers: 5)
Infinite Dimensional Analysis, Quantum Probability and Related Topics     Hybrid Journal  
InfraMatics     Open Access  
Infrared Physics & Technology     Hybrid Journal  
Intelligent Transportation Systems Magazine, IEEE     Full-text available via subscription   (Followers: 1)
Intermetallics     Hybrid Journal   (Followers: 8)
International Applied Mechanics     Hybrid Journal   (Followers: 2)
International Geophysics     Full-text available via subscription   (Followers: 3)
International Journal for Computational Methods in Engineering Science and Mechanics     Hybrid Journal   (Followers: 8)
International Journal for Ion Mobility Spectrometry     Hybrid Journal   (Followers: 1)
International Journal for Simulation and Multidisciplinary Design Optimization     Full-text available via subscription   (Followers: 1)
International Journal of Abrasive Technology     Hybrid Journal   (Followers: 2)
International Journal of Aeroacoustics     Full-text available via subscription   (Followers: 6)
International Journal of Applied Electronics in Physics & Robotics     Open Access   (Followers: 1)
International Journal of Astronomy and Astrophysics     Open Access   (Followers: 3)
International Journal of Computational Materials Science and Surface Engineering     Hybrid Journal   (Followers: 7)
International Journal of Damage Mechanics     Hybrid Journal   (Followers: 5)
International Journal of Fatigue     Hybrid Journal   (Followers: 8)
International Journal of Fracture     Hybrid Journal   (Followers: 9)
International Journal of Geometric Methods in Modern Physics     Hybrid Journal   (Followers: 1)
International Journal of Geophysics     Open Access   (Followers: 3)
International Journal of Heat and Fluid Flow     Hybrid Journal   (Followers: 14)
International Journal of Low Radiation     Hybrid Journal  
International Journal of Low-Carbon Technologies     Open Access   (Followers: 1)
International Journal of Mass Spectrometry     Hybrid Journal   (Followers: 11)
International Journal of Material Forming     Hybrid Journal   (Followers: 2)
International Journal of Materials and Product Technology     Hybrid Journal   (Followers: 4)
International Journal of Mechanical Sciences     Hybrid Journal   (Followers: 5)
International Journal of Mechanics and Materials in Design     Hybrid Journal   (Followers: 5)
International Journal of Medical Physics, Clinical Engineering and Radiation Oncology     Open Access   (Followers: 4)
International Journal of Micro-Nano Scale Transport     Full-text available via subscription   (Followers: 2)
International Journal of Microstructure and Materials Properties     Hybrid Journal   (Followers: 7)
International Journal of Microwave Science and Technology     Open Access   (Followers: 2)
International Journal of Modeling, Simulation, and Scientific Computing     Hybrid Journal   (Followers: 1)
International Journal of Modern Physics A     Hybrid Journal   (Followers: 2)
International Journal of Modern Physics B     Hybrid Journal   (Followers: 1)
International Journal of Modern Physics C     Hybrid Journal   (Followers: 1)
International Journal of Modern Physics D     Hybrid Journal   (Followers: 1)
International Journal of Modern Physics E     Hybrid Journal   (Followers: 3)
International Journal of Nanomanufacturing     Hybrid Journal   (Followers: 1)
International Journal of Nanoscience     Hybrid Journal   (Followers: 1)

  First | 1 2 3 4 5 6 | Last

Journal Cover   Flexible Services and Manufacturing Journal
  [SJR: 0.671]   [H-I: 25]   [3 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1936-6582 - ISSN (Online) 1936-6590
   Published by Springer-Verlag Homepage  [2300 journals]
  • Cross-docking assessment and optimization using multi-agent co-simulation:
           a case study
    • Abstract: Abstract Cross-docking is an operation where incoming freights from trucks or trains are directly loaded onto outbound trucks or trains to distributors, theoretically eliminating the need for interim storage warehouses. It is widely used throughout the retail industry to reduce supply chain related costs. In this paper, a cross-docking feasibility and optimization case study, based on a simulation model framework, is presented. The simulation model framework is created using the hybrid of discrete-event and agent-based model, allowing accurate and customized description of suppliers, distributors, and the cross-dock. The simulation model framework was used to assess the feasibility of implementing cross-docking operation for a global manufacturing firm’s technical consumer product supply chain and to optimize the cross-docking performance within established constraints. Controllable input parameters were evaluated for their impact to key cross-docking metrics and optimized for best cross-docking operation performances. Analysis and optimization results are presented with recommendations.
      PubDate: 2015-03-01
       
  • Master production scheduling and sequencing at mixed-model assembly lines
           in the automotive industry
    • Abstract: Abstract The customization of final products in the automotive industry involves a large number of optional parts and leads to a huge variety of operation times at the various stations of the assembly line. The master production scheduling problem (MPS) for high-variant mixed-model assembly lines is to assign the individual customer-defined models of a basic product type to short-term production periods while anticipating the negative impacts of an unbalanced model sequence at the lower planning level. We propose a mathematical model formulation for the MPS and develop heuristic solution procedures that attempt to minimize the workload variability. Specifically, these procedures anticipate decisions on the mixed-model sequence and the resulting work overload at stations which has to be balanced by the assignment of utility workers. Furthermore, an integrated planning approach for solving the MPS and the production sequencing problem is proposed.
      PubDate: 2015-03-01
       
  • Order batching and sequencing for the minimization of the total tardiness
           in picker-to-part warehouses
    • Abstract: Abstract Order picking deals with the retrieval of articles from their storage locations in order to satisfy customer requests. The transformation and consolidation of customer orders into picking orders (batches) is pivotal for the performance of order picking systems. Typically, customer orders have to be completed by certain due dates in order to avoid delays in production or in the shipment to customers. The composition of the batches, their processing times, their assignment to order pickers and the sequence according to which they are scheduled determine whether and the extent to which the due dates are missed. This article shows how Variable Neighborhood Descent and Variable Neighborhood Search can be applied in order to minimize the total tardiness of a given set of customer orders. In a series of extensive numerical experiments, the performance of the two approaches is analyzed for different problem classes. It is shown that the proposed methods provide solutions which may allow order picking systems to operate more efficiently.
      PubDate: 2015-03-01
       
  • Proposal of a nonlinear multi-objective genetic algorithm using conic
           scalarization to the design of cellular manufacturing systems
    • Abstract: Abstract This paper presents a nonlinear multi-objective mathematical model to obtain quality solutions for design problems of cellular manufacturing systems. The objectives of the multi-objective model are, simultaneously, (1) to minimize the number of exceptional elements among manufacturing cells, (2) to minimize the number of voids in a cell, and (3) to minimize cell load variation. In this paper, a new multi-objective genetic algorithm (GA) approach has been proposed to solve the multi-objective problem. In contrast to existing GA approaches, this GA approach contains some revised genetic operators and uses a conic scalarization method to convert the mathematical model’s objectives in a single objective function. This approach has been tested and compared with two test problems and some source models collected from the literature. The results have shown that the problem-solving performance of the proposed multi-objective approach is at least as good as the existing approaches in designing the cellular system, and in many cases better than them.
      PubDate: 2015-03-01
       
  • A hierarchical facility layout planning approach for large and complex
           hospitals
    • Abstract: Abstract The transportation processes for patients, personnel, and material in large and complex maximum-care hospitals with many departments can consume significant resources and thus induce substantial logistics costs. These costs are largely determined by the allocation of the different departments and wards in possibly multiple connected hospital buildings. We develop a hierarchical layout planning approach based on an analysis of organizational and operational data from the Hannover Medical School, a large and complex university hospital in Hannover, Germany. The purpose of this approach is to propose locations for departments and wards for a given system of buildings such that the consumption of resources due to those transportation processes is minimized. We apply the approach to this real-world organizational and operational dataset as well as to a fictitious hospital building and analyze the algorithmic behavior and resulting layout.
      PubDate: 2015-02-25
       
  • Planning of waste electrical and electronic equipment (WEEE) recycling
           facilities: MILP modelling and case study investigation
    • Abstract: Abstract Waste electrical and electronic equipment (WEEE) consist of many different substances some of which contain hazardous components and valuable materials. The recovery of WEEE plays a key role on environmental sustainability because it minimizes the negative effects of hazardous materials and helps the efficient use of world’s limited resources. Recovery strategies enable companies to collect reusable components and to recycle the material content of WEEE by using operations like sorting, disassembly and bulk recycling. Usually companies associated with municipals collect WEEE from end-users and/or collection points. Then they sell these items to WEEE recycling facilities through bidding. For recycling facilities, it is important to generate the best operational level decisions to receive and handle WEEE. This study contributes to the fulfillment of this need by presenting a mixed integer linear programming model to determine the maximum bid price offer while determining the best operation planning strategies. In order to demonstrate the potential of the proposed model, a real life case study along with several scenarios is studied. The findings of the case study indicate that the model has the potential to enable the decision maker to come with stronger decisions related to both bidding process and operational strategies of the facility.
      PubDate: 2015-02-21
       
  • Design and analysis of gastroenterology (GI) clinic in Digestive Health
           Center of University of Wisconsin Health
    • Abstract: Abstract This paper is devoted to the design and analysis of the gastroenterology (GI) clinic in the Digestive Health Center (DHC) of University of Wisconsin Health. The DHC will consolidate several existing clinic and endoscopy locations into a single center. First, the work flow at a current GI clinic is studied. A Markov chain model is developed and then extended to non-Markovian case to evaluate patient average length of stay and staff utilization. The model is validated by the data observed in the clinic. It is shown that the model can provide accurate estimation of system performance. Then, using such a model, design options of the new GI clinic in the DHC are studied. To investigate the impact of different system configurations, what-if analyses are carried out and different patient check-out processes are investigated. Finally, recommendations for enhancing service at the new GI clinic are proposed to the DHC leadership.
      PubDate: 2015-02-20
       
  • An analytical representation of flexible resource allocation in hospitals
    • Abstract: Abstract Non-linear processes within complex systems are difficult to predict. Using discrete event simulation (DES) models can be helpful for presenting the uncertainty level embedded within these processes. However, the interpretations of the resulting outcomes can be challenging to analyze. This is evident when experimenting with simulation models, and therefore requires the adaptation of existing models. Introducing cyclic entities such as interconnected resources to the simulation model adds a new level of complexity to the model. In practical cases, decision makers often demand a model that enables them to make quick decisions with less complexity involved. However, these individuals still want to be assured of a high degree of accuracy in the results. This article demonstrates how an analytical representation of complex DES models can be developed in order to facilitate prompt yet effective solutions for decision makers. This analytical representation provides a brief overview of the simulation results by using the staff scheduling and nurses’ utilization approaches. Results of the effective use of DES model and managers feedback are encouraging.
      PubDate: 2015-02-07
       
  • Operating room scheduling and rescheduling: a rolling horizon approach
    • Abstract: Abstract In this work we consider the problem of selecting a set of patients among a given waiting list of elective patients and assigning them to a set of available operating room blocks. We assume a block scheduling strategy in which the number and the length of available blocks are given. As each block is related to a specific day, by assigning a patient to a block his/her surgery date is fixed, as well. Each patient is characterized by a recommended maximum waiting time and an uncertain surgery duration. In practical applications, new patients enter the waiting list continuously. Patient selection and assignment is performed by surgery departments on a short-term, usually a week, regular base. We propose a so-called rolling horizon approach for the patient selection and assignment. At each iteration short-term patient assignment is decided. However, in a look-ahead perspective, a longer planning horizon is considered when looking for the patient selection. The mid-term assignment over the next \(n\) weeks is generated by solving an ILP problem, minimizing a penalty function based on total waiting time and tardiness of patients. The approach is iteratively applied by shifting ahead the mid-term planning horizon. When applying the first week solution, unpredictable extensions of surgeries may disrupt the schedule. Such disruptions are recovered in the next iteration: the mid-term solution is rescheduled limiting the number of variations from the previously computed plan. Besides, the approach allows to deal with new patient arrivals. To keep limited the number of disruptions due to uncertain surgery duration, we propose also a robust formulation of the ILP problem. The deterministic and the robust formulation based frameworks are compared over a set of instances, including different stochastic realization of surgery times.
      PubDate: 2015-01-31
       
  • Rolling horizon planning for a dynamic collaborative routing problem with
           full-truckload pickup and delivery requests
    • Abstract: Abstract In order to improve their operational efficiency, small and mid-sized freight forwarders can establish horizontal coalitions in order to exchange customer requests. Decentralized operational transportation planning processes enabling request exchange among forwarders in spite of information asymmetry and distributed decision-making competences is referred to as collaborative transportation planning (CTP). CTP can help forwarders take advantage of economies of scale and reduce their costs of fulfilling customer requests compared to the case of isolated planning without request exchange. In order to exploit the potential of cost-savings embedded in CTP, appropriate request exchange mechanisms have to be developed. In this paper, the dynamic CTP problem of a coalition of freight forwarders serving full-truckload transport requests is studied. Two rolling horizon planning approaches are proposed to solve the dynamic routing problems. It is analyzed how the planning results, in particular the cost reduction realized by CTP, are influenced by different planning settings. Computational experiments show that the planning results of CTP are considerably superior to those obtained by isolated planning, and the realized cost-savings in percentage remain relatively constant, independently of the test settings.
      PubDate: 2015-01-18
       
  • A quay crane system that self-recovers from random shocks
    • Abstract: Abstract The main challenge for a container terminal is to maximize its throughput using limited resources subject to various operational constraints under uncertainty. Traditional methods try to achieve this through an optimized plan by solving a quay crane scheduling problem; but the plan may become obsolete or infeasible after shocks (changes in the system due to uncertainty). To respond to shocks these methods require frequent re-planning, which increases the operations cost. We propose a new method to counter this. Instead of creating plans, we develop an operating protocol to respond to shocks without re-planning. Under this protocol, each quay crane along a berth follows simple rules to serve vessels that arrive continuously in time. If the system is configured properly, it always spontaneously recovers to its efficient form after a random shock. The average throughput of the system operating on its efficient form is very near its full capacity if the crane travel time per bay is relatively short. This self-recovery is robust even under a sequence of shocks as the system persistently restores its throughput after each shock. Most importantly, this is accomplished without complex computation.
      PubDate: 2015-01-13
       
  • An estimation of distribution algorithm and new computational results for
           the stochastic resource-constrained project scheduling problem
    • Abstract: Abstract In this paper we propose an estimation of distribution algorithm (EDA) to solve the stochastic resource-constrained project scheduling problem. The algorithm employs a novel probability model as well as a permutation-based local search. In a comprehensive computational study, we scrutinize the performance of EDA on a set of widely used benchmark instances. Thereby, we analyze the impact of different problem parameters as well as the variance of activity durations. By benchmarking EDA with state-of-the-art algorithms, we can show that its performance compares very favorably to the latter, with a clear dominance in instances with medium to high variance of activity duration.
      PubDate: 2015-01-13
       
  • Control problems and management policies in health systems: application to
           intensive care units
    • Abstract: Abstract The stochastic nature of both patient arrivals and lengths of stay leads inevitably to periodic bed shortages in healthcare units. Physicians are challenged to fit demand to service capacity. If all beds are occupied eligible patients are usually referred to another ward or hospital and scheduled surgeries may be cancelled. Lack of beds may also have consequences for patients, who may be discharged in advance when the number of occupied beds is so high as to compromise the medical care of new incoming patients. In this paper we deal with the problem of obtaining efficient bed-management policies. We introduce a queuing control problem in which neither the arrival rates nor the number of servers can be modified. Bed occupancy control is addressed by modifying the service time rates, to make them dependent on the state of the system. The objective functions are two quality-of-service components: to minimize patient rejections and to minimize the length of stay shortening. The first objective has a clear mathematical formulation: minimize the probability of rejecting a patient. The second objective admits several formulations. Four different expressions, all leading to nonlinear optimization problems, are proposed. The solutions of these optimization problems define different control policies. We obtain the analytical solutions by adopting Markov-type assumptions and comparing them in terms of the two quality-of-service components. We extend these results to the general case using optimization with simulation, and propose a way to simulate general length of stay distributions enabling the inclusion of state-dependent service rates.
      PubDate: 2014-12-16
       
  • Mixed bundle retailing under a stochastic market
    • Abstract: Abstract Bundling is a pervasive marketing strategy in real business. In this paper, we study the strategy of mixed bundling under a stochastic market for two products for a retailer who has monopolistic power in the market, and the bundle consists of one unit of each individual product. The retailer needs to make joint pricing and inventory decisions with the aim of maximizing expected profit. Firstly, the relationship between the prices and market shares of the three bundle variations in the mixed bundling strategy is modeled after the reservation price model, which is commonly adopted in the bundling literature. Based on the market shares, a two-stage stochastic model is proposed to determine inventory decisions, including the ordering decision before the selling season starts and the allocation decisions after demands are realized. Global concavity in the order quantities is demonstrated. For experimental purposes, an algorithm incorporating both pricing and inventory decisions is presented. We measure the importance of incorporating inventory matters into bundling decisions under the stochastic market by calculating expected loss of profit, which can exceed 5 % under some parameter settings. In the numerical experiments, we identify two attributes of mixed bundling performance, which are bundling pricing effect and inventory pooling effect.
      PubDate: 2014-12-06
       
  • Susceptibility of optimal train schedules to stochastic disturbances of
           process times
    • Abstract: Abstract This work focuses on the stochastic evaluation of train schedules computed by a microscopic scheduler of railway operations based on deterministic information. The research question is to assess the degree of sensitivity of various rescheduling algorithms to variations in process times (running and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced rescheduling algorithms. Computational results are based on a complex and densely occupied Dutch railway area; train delays are computed based on accepted statistical distributions, and dwell and running times of trains are subject to additional stochastic variations. From the results obtained on a real case study, an advanced branch and bound algorithm, on average, outperforms a First In First Out scheduling rule both in deterministic and stochastic traffic scenarios. However, the characteristic of the stochastic processes and the way a stochastic instance is handled turn out to have a serious impact on the scheduler performance.
      PubDate: 2014-12-01
       
  • Heuristics for an oil delivery vehicle routing problem
    • Abstract: Abstract Companies distributing heating oil typically solve vehicle routing problems on a daily basis. Their problems may involve various features such as a heterogeneous vehicle fleet, multiple depots, intra-route replenishments, time windows, driver shifts and optional customers. In this paper, we consider such a rich vehicle routing problem that arises in practice and develop three metaheuristics to address it, namely, a tabu search (TS) algorithm, a large neighborhood search (LNS) heuristic based on this TS heuristic and another LNS heuristic based on a column generation (CG) heuristic. Computational results obtained on instances derived from a real-world dataset indicate that the LNS methods outperform the TS heuristic. Furthermore, the LNS method based on CG tends to produce better quality results than the TS-based LNS heuristic, especially when sufficient computational time is available.
      PubDate: 2014-12-01
       
  • A genetic local search algorithm for the multi-depot heterogeneous fleet
           capacitated arc routing problem
    • Abstract: Abstract This paper studies the multi-depot heterogeneous fleet capacitated arc routing problem (MDHCARP), a problem with rare research in the past, but with many applications in real life. The MDHCARP extends the capacitated arc routing problem (CARP) by considering both the multi-depot case and limited heterogeneous fleet constraints. We propose a genetic local search (GLS) algorithm for the MDHCARP. The GLS is appraised on simplified MDHCARP cases and on general MDHCARP instances from CARP files; and computational results show that the GLS outperforms an extended memetic algorithm and meanwhile they both improve best-known solutions of the simplified MDHCARP benchmark cases.
      PubDate: 2014-12-01
       
  • Retraction Note to: Effect of reconfiguration costs on planning for
           capacity scalability in reconfigurable manufacturing systems
    • PubDate: 2014-11-13
       
  • Optimal server allocation in closed finite queueing networks
    • Abstract: Abstract Many topological network design problems in manufacturing and service systems can be modelled with closed queueing networks, finite buffers, and multiple-servers. Because of their integrality, it is difficult to predict the performance of these problems, let alone optimize their parameters. This paper presents a new queue decomposition approach for the modelling of these finite buffer closed queueing networks with multiple servers along with an integrated approach to the optimization of the allocation of the servers in the network topology. The performance and optimization algorithms are described and a number of experiments for series, merge, and split topologies together with the integration of material handling and layout systems are carried out.
      PubDate: 2014-09-09
       
  • Logistics, traffic and transportation
    • PubDate: 2014-07-15
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2014