A Simulation Study of an Object-Oriented Integration Testbed for Process Planning and Production Scheduling

Many studies on integration of process planning and production scheduling have been carried out during the last decade. While various integration approaches and algorithms have been proposed, the implementation of these approaches is still a difficult issue. To achieve successful implementation, it is important to examine and evaluate integration approaches or algorithms beforehand. Based on an object-oriented integration testbed, a simulation study that compares different integration algorithms is presented in this paper. Separated planning method and integrated planning methods are examined. Also, situations of both fixed and variable processing times are simulated, and useful results have been observed. The successful simulation with the object-oriented integration testbed eventually will be extended to include other new planning algorithms for examining their effectiveness and implementation feasibility.     

Grey-Theory-Based Optimization Model of Emergency Logistics Considering Time Uncertainty

Natural disasters occur frequently in recent years, causing huge casualties and property losses. Nowadays, people pay more and more attention to the emergency logistics problems. This paper studies the emergency logistics problem with multi-center, multi-commodity, and single-affected-point. Considering that the path near the disaster point may be damaged, the information of the state of the paths is not complete, and the travel time is uncertainty, we establish the nonlinear programming model that objective function is the maximization of time-satisfaction degree. To overcome these drawbacks: the incomplete information and uncertain time, this paper firstly evaluates the multiple roads of transportation network based on grey theory and selects the reliable and optimal path. Then simplify the original model under the scenario that the vehicle only follows the optimal path from the emergency logistics center to the affected point, and use Lingo software to solve it. The numerical experiments are presented to show the feasibility and effectiveness of the proposed method.     

The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization

A cook has to prepare n cakes using an oven with two racks. According to the recipe, the i-th cake has to be baked for exactly a _i minutes. Cakes to be cooked are taken from a table and carried to the oven, and once cooked are carried back to the table by means of a trolley that can carry two cakes at a time. What is the minimum number q ^* of round trips required of the cook? This problem has application to the operation scheduling of transportation systems and to material cutting. A different problem arises according to whether the cook accepts or not to stay near the oven for awhile with the trolley. If the trolley cannot be idle at the oven, an optimum schedule with no oven idle-time always exists: consequently, the trolley schedule is trivial, and the problem is transformed into a set packing. For this case, we propose and test a heuristic method which generates all of the promising columns of the set packing, and solves the resulting problem by branch-and-bound. Instead, if the trolley can be idle at the oven for a limited amount of time, a problem arises to find an optimal schedule of the trolley: in this case we show how to use a scaling technique in order to obtain a very good feasible solution by the method above.     

新形势下的传染病医院医疗应急后勤保障工作

传染病因其不可预测性和突发性,已经成为人类生存的大敌。随着气候的变化和环境的破坏,新老传染病（SARS、甲型H1N1流感、禽流感、TB等）相继出现及复燃,人民的健康不时受到威胁,传染病医院肩负着防治疾病的重任并面临巨大挑战。因此如何做好医疗应急后勤保障工作是当今新形势下传染病医院工作的重中之重。     

Efficient and Accurate Time-Stepping Schemes for Integrate-and-Fire Neuronal Networks

To avoid the numerical errors associated with resetting the potential following a spike in simulations of integrate-and-fire neuronal networks, Hansel et al. and Shelley independently developed a modified time-stepping method. Their particular scheme consists of second-order Runge-Kutta time-stepping, a linear interpolant to find spike times, and a recalibration of postspike potential using the spike times. Here we show analytically that such a scheme is second order, discuss the conditions under which efficient, higher-order algorithms can be constructed to treat resets, and develop a modified fourth-order scheme. To support our analysis, we simulate a system of integrate-and-fire conductance-based point neurons with all-to-all coupling. For six-digit accuracy, our modified Runge-Kutta fourth-order scheme needs a time-step of t = 0.5 × 10^–3 seconds, whereas to achieve comparable accuracy using a recalibrated second-order or a first-order algorithm requires time-steps of 10^–5 seconds or 10^–9 seconds, respectively. Furthermore, since the cortico-cortical conductances in standard integrate-and-fire neuronal networks do not depend on the value of the membrane potential, we can attain fourth-order accuracy with computational costs normally associated with second-order schemes.     

Sampling Schemes for Studying Growth of Children

Efficiency of linked cross-sectional scheme has been compared with pure longitudinal schemes for generalised estimation of norm relaxing the condition of constancy of variances. The relevant theory of estimation has been developed and the expression for the optimum estimators alongwith their variances have been derived. The percentage gain in efficiency has been calculated. It has been observed that for higher values of Q, percentage gain in efficiency of proposed scheme over cross-sectional is very high.     

Disease Recording Systems and Herd Health Schemes for Production Diseases

Disease recording of cattle is compulsory in Sweden and Norway. Sweden and Denmark also have mandatory disease recording for swine, whereas Finland and Norway only have compulsory recording of infectious diseases. Both compulsory and voluntary systems are databased, the first ones developed in the 1970's.

Disease recording at pig slaughtering is somewhat older. The veterinary practitioner, and often also the farmer, can report treated cases as well as fertility disturbances to the systems. Disease recording at slaughter is carried out by veterinarians and inspection officers. The databases are handled by the veterinary authorities or the agricultural organisations in each country. Costs are defrayed by the authorities and/or the agricultural industry. The farmers receive periodic reports. Data are stored for three to ten years, often longer. Affiliation to animal health schemes for cattle or swine is voluntary. In Sweden and Denmark (cattle) they are run within the scope of government regulations. Affiliation to animal health programmes may also be demanded by organisations within the agricultural industry. These organisations are also responsible for the administration of the programmes. Costs to take part in herd health schemes are covered by the farmers themselves. In certain cases, grants are received from agricultural organisations, authorities, or the European Union. Recording of diseases and the format of animal health schemes in the Nordic countries are described here in order to illustrate the possibilities to compare data between countries.

     

Disease Recording Systems and Herd Health Schemes for Production Diseases

Disease recording of cattle is compulsory in Sweden and Norway. Sweden and Denmark also have mandatory disease recording for swine, whereas Finland and Norway only have compulsory recording of infectious diseases. Both compulsory and voluntary systems are databased, the first ones developed in the 1970's.Disease recording at pig slaughtering is somewhat older. The veterinary practitioner, and often also the farmer, can report treated cases as well as fertility disturbances to the systems. Disease recording at slaughter is carried out by veterinarians and inspection officers. The databases are handled by the veterinary authorities or the agricultural organisations in each country. Costs are defrayed by the authorities and/or the agricultural industry. The farmers receive periodic reports. Data are stored for three to ten years, often longer. Affiliation to animal health schemes for cattle or swine is voluntary. In Sweden and Denmark (cattle) they are run within the scope of government regulations. Affiliation to animal health programmes may also be demanded by organisations within the agricultural industry. These organisations are also responsible for the administration of the programmes. Costs to take part in herd health schemes are covered by the farmers themselves. In certain cases, grants are received from agricultural organisations, authorities, or the European Union. Recording of diseases and the format of animal health schemes in the Nordic countries are described here in order to illustrate the possibilities to compare data between countries.     

Fair Scheduling for Input Buffered Switches

Input buffered switch architecture has become attractive for implementing high performance switches for workstation clusters. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative Fair Scheduling (iFS) scheme for input buffered switches that supports fair bandwidth distribution among the flows and achieves asymptotically 100% throughput. We then apply the idea of fair scheduling to switches with multicasting capability and propose an mFS scheme which allocates bandwidth to various flows according to their reservations. We show that mFS produces throughput comparable to the existing schemes while distributing the bandwidth as per the given reservations. Extensive simulation results are presented to validate the effectiveness of our proposed schemes.     

A Classification for Hoist Scheduling Problems

Electroplating lines are totally automated manufacturing systems that are used to cover parts with a coat of metal. They consist of a set of tanks between which the parts to be treated are transported by one or several hoists. Scheduling the movements of these hoists is commonly called a hoist scheduling problem (HSP) in the literature. But the assumptions and constraints that must be taken into account greatly depend on the production environment (physical system, manufacturing specifications, and management policies). Consequently, there exist several classes of HSPs. The systematic frameworks usually used to classify deterministic scheduling problems do not allow distinguishing between these various kinds of HSPs. Therefore, identifying the scope of each published work and comparing the various proposed scheduling methods turn out to be difficult. Thus, this article presents notation for scheduling problems in electroplating systems, to make the specification of problem types and the identification of studied problem instances easier. An associated typology gives a survey of the literature and demonstrates the usefulness of the proposed classification scheme.     

Level Scheduling for batched JIT supply

A mixed-model assembly line requires the solution of a short-term sequencing problem which decides on the succession of different models launched down the line. A famous solution approach stemming from the Toyota Production System is the so-called Level Scheduling, which aims at distributing the part consumption induced by the model sequence evenly over time. Traditional Level Scheduling seeks to closely approximate target demand rates at every production cycle, however, such a strict leveling is only required if parts are directly pulled from a connected feeder line. In real-world assembly lines, parts are predominately delivered in (small) batches at certain points in time. In such a situation, a Just-in-Time supply is already facilitated whenever the cumulative consumption is leveled in accordance with each part’s delivery schedule, while the exact consumption pattern between two delivery points seems irrelevant. The paper on hand provides new Level Scheduling models, proves complexity, presents exact and heuristic solution procedures and shows inferiority of traditional Level Scheduling for such a batched JIT-supply of parts.     

Improving Feedback Merging for Source-Adaptive Layered Multicast Schemes

Current source-adaptive layered multicast schemes exploit merging capabilities at special nodes in the network to combine feedback from the multicast group. The merging procedures reduce network load and avoid feedback implosion at the source. In this paper, we demonstrate how to increase the efficiency of a merger node. We show how to tune two mechanisms: feedback transmission, on the timer settings used by receivers, and temporal merging, on the timer settings used by intermediate nodes. Our approach is generic, relating purely to timer settings, and does not touch on content merging, or the decision regarding which packets to forward. We investigate the effects of temporal merging on packet suppression. We show that periodic feedback transmission coupled with a suitable timer setting at the merger node increases efficiency.     

Models and Algorithms for Hub and Spoke Locations for Emergency Service Facilities in Response to Serious Emergency Incidents

This article examines the location-allocation of emergency service facilities as a research subject. The research presents the setup of the single allocation set covering location-allocation models for emergency service facilities under strong time constraints, in view of the shortage of hub & spoke network bypass. The article also presents an extension to the single allocation set covering location-allocation model (SASCP) and the SASCP model with bypass constraints (γ-SASCP) for emergency service facilities under large-scale emergency requirements. For the two models, an improved genetic algorithm was designed and the two models were respectively solved, with the effectiveness of the algorithm verified by a specific example. The impacts of change of parameters such as time discount rate, maximum time constraints, and bypass ratio on the model's results are compared and analyzed, based on solved results by the specific example.     

Beyond the State and Failed Schemes

In this article, I propose five ways to move beyond the analytical scheme of James Scott's Seeing Like a State (1998). I question the spatial optic that posits an up there, all-seeing state operating as a preformed repository of power, spread progressively outward to nonstate spaces beyond its reach. I highlight the role of parties beyond the state that attempt to govern—social reformers, scientists, and the so-called nongovernmental agencies, among others. I look beyond authoritarian high modernism to the more general problematic of improvement emerging from a governmental rationality focused on the welfare of populations. I explore the recourse to mētis (contextualized, local knowledge and practice) situated beyond the purview of planning. Finally, I reframe the question posed by Scott—why have certain schemes designed to improve the human condition failed?—to examine the question posed so provocatively by James Ferguson: What do these schemes do? What are their messy, contradictory, conjunctural effects?     

Intelligent Scheduling for Underground Mobile Mining Equipment

Many studies have been carried out and many commercial software applications have been developed to improve the performances of surface mining operations, especially for the loader-trucks cycle of surface mining. However, there have been quite few studies aiming to improve the mining process of underground mines. In underground mines, mobile mining equipment is mostly scheduled instinctively, without theoretical support for these decisions. Furthermore, in case of unexpected events, it is hard for miners to rapidly find solutions to reschedule and to adapt the changes. This investigation first introduces the motivation, the technical background, and then the objective of the study. A decision support instrument (i.e. schedule optimizer for mobile mining equipment) is proposed and described to address this issue. The method and related algorithms which are used in this instrument are presented and discussed. The proposed method was tested by using a real case of Kittilä mine located in Finland. The result suggests that the proposed method can considerably improve the working efficiency and reduce the working time of the underground mine.