Supply Coordination Based on Bonus Policy in Assembly under Uncertain Delivery Time

The existing research of supply coordination under uncertain delivery time mainly focuses on the collaboration between the supplier and the manufacturer, which aim at minimizing the total cost of each side and finding comparative optimal solutions under decentralized decision. In the supply coordination, the collaboration between suppliers in assembly system is usually not considered. As a result, the manufacturer’s production is often delayed due to mismatching delivery of components between suppliers. Therefore, to ensure supply coordination in assembly system, collaboration between suppliers should be taken into consideration. In this paper, an assembly system with two suppliers and one manufacturer under uncertain delivery time is considered. The model is established and optimal solution is given under decentralized decision. Furthermore, the cost functions of two suppliers are both convex, and a unique Nash equilibrium exists between two suppliers. Then the optimal decision under supply coordination is analyzed, which is regarded as a benchmark for supply coordination. Additionally, the total cost of the assembly system is jointly convex in agreed delivery time. To achieve supply coordination a bonus policy is explored in the assembly system under uncertain delivery time, and the total cost under bonus policy must be lower than under decentralized decision. Finally the numerical and sensitivity analysis shows the cost of assembly system under bonus policy equals that under supply coordination, and the cost of each side in assembly system under bonus policy is lower compared to that under decentralized decision. The proposed research minimizes the total cost of each side with bonus policy in assembly system, ensures the supply coordination between suppliers and the manufacturer, and improves the competiveness of the whole supply chain.

Shortening the delivery time of proton therapy by real-time compensation method with raster scanning

Among the various scanning techniques, spot and raster scanning are the most frequently adopted. Raster scanning turns off the beam only when each isoenergy slice irradiation is completed. This feature intrinsically solves the leakage dose and frequent beam-switching problems encountered during spot scanning. However, to shorten the delivery time of raster scanning, a sophisticated dose control strategy is required to guarantee dose distribution.In this study, a real-time compensation method with raster scanning for synchrotron systems was designed. It is characterized by a small spot-spacing planning strategy and real-time subtraction of the transient number of particles delivered between two planning-spot positions from the planned number of particles of the subsequent raster point.The efficacy of the compensation method was demonstrated by performing accurate raster scanning simulations with an in-house simulation code and accurate final dose evaluations with a commercial treatment planning system.Given the similar dose evaluation criteria under a practical high scanning speed, compared with the spot scanning method, the total delivery time of the compensated raster scanning method was significantly shortened by 53.3% in the case of irradiating a cubical target and by 28.8% in a pelvic case. Therefore, it can be concluded that real-time compensated raster scanning with a fast scanning configuration can significantly shorten the delivery time compared to that of spot scanning. It is important to reduce the pressure on patients caused by prolonged immobilization and to improve patient throughput capacity at particle therapy centers.

Online Scheduling on a Parallel Batch Machine with Delivery Times and Limited Restarts

The online scheduling on an unbounded parallel batch machine with delivery times and limited restarts is studied in this paper.Here,online means that jobs arrive over time and the characteristics of a job become known until it arrives.Limited restarts mean that once a running batch contains at least one restarted job,it cannot be restarted again.The goal is to minimize the time by which all jobs have been delivered.We consider a restricted model that the delivery time of each job is no more than its processing time.We present a best possible online algorithm with a competitive ratio of 3/2 for the problem.

Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.

Timing of Elective Repeat Cesarean Delivery at 38 Weeks versus 39 Weeks: Rate of Spontaneous Onset of Labor before Planned Cesarean Section and Impact on Maternal Outcome: A Retrospective Cohort Study

Background: The timing of elective repeat cesarean delivery at 38 weeks versus 39 weeks is still a debatable subject, both regarding maternal and neonatal outcomes. In the Saudi context, there is lack of local data to aid decision-making regarding the timing of elective repeat cesarean delivery. Objectives: To estimate the rate of spontaneous onset of labor before the planned gestational age for repeat cesarean section in women who were booked at gestational age of (39 0/7 - 39 6/7) weeks (W39) versus (38 0/7 - 38 6/7) weeks (W38) and to compare the rate of maternal composite outcome between these groups. Design: Retrospective cohort. Setting: This study was conducted at King Abdulaziz Medical City, Jeddah, KSA. Method: Delivery registry books were reviewed to identify all deliveries from 1 January 2014 to 31 December 2016 (3 years). All low-risk pregnant women who had 2 or more cesarean deliveries and who met the inclusion criteria were included. Results: A total of 440 women were included of whom 318 (72.3%) were planned for elective cesarean section at W38 gestational age and 122 women at W39 gestational age. Mothers planned at W39 had higher rate of emergency cesarean deliveries versus those planned at W38 (18.0% versus 10.4%, p = 0.030;RR = 13.06), most frequently due to early onset of contractions (16.4% versus 8.2%, p = 0.012;RR = 12.17) or cervical dilatation (11.6% versus 5.4%, p = 0.024, RR = 16.15). No difference in the incidence of individual or composite maternal complications was noted between the two groups. Mother’s age (OR 0.93, p = 0.018) and schedule date at W39 (OR = 1.94, p = 0.028) were independently associated with spontaneous onset of labor before the scheduled gestational age, while no association was found with parity, previous number of spontaneous vaginal deliveries, number of previous cesarean deliveries or interval from last cesarean delivery. Conclusion: Elective cesarean section scheduled at 39 weeks of gestation or beyond carries a higher risk of emergency cesarean section, with no significant increase in maternal complications. The identification of factors associated with spontaneous onset of labor before the planned gestational age should be carefully identified to determine the optimal timing.

Real-time performance of periodic data transmission in EPA industrial Ethernet

To evaluate and improve the real-time performance of Ethernet for plant automation（EPA） industrial Ethernet,the real-time performance of EPA periodic data transmission was theoretically and experimentally studied.By analyzing information transmission regularity and EPA deterministic scheduling mechanism,periodic messages were categorized as different modes according to their entering-queue time.The scheduling characteristics and delivery time of each mode and their interacting relations were studied,during which the models of real-time performance of periodic information transmission in EPA system were established.On this basis,an experimental platform is developed to test the delivery time of periodic messages transmission in EPA system.According to the analysis and the experiment,the main factors that limit the real-time performance of EPA periodic data transmission and the improvement methods were proposed.

Preloaded and non-preloaded intraocular lens delivery system and characteristics: human and porcine eyes trial

AIM： To compare characteristics of preloaded and nonpreloaded intraocular lens（IOL） delivery systems during IOL delivery procedures. METHODS： Total 101 human eyes were included in this prospective observational case series. Delivery characteristics of 5 types of IOLs including i Sert250 NC60（NC60）, En Vista MX60（MX60）, Acry Sof IQ SN60 WF（SN60 WF）, TECNIS ZCB00（ZCB00）, and TECNIS PCB00（PCB00） were investigated. NC60 and PCB00 were injected via preloaded delivery systems and other IOLs were injected via nonpreloaded systems. In the human trial, time taken from IOL loading to completion of implantation was measured in all eyes undergoing conventional cataract surgery. Using 4 excised porcine eyes, dynamics of ophthalmic viscosurgical device（OVD） between an IOL injector and a porcine eye was analyzed using fluorescein sodiumstained OVD. RESULTS： The average time for IOL implantation was 22.0 s for NC60, 43.2 s for MX60, 32.3 s for SN60 WF, 41.4 s for ZCB00, and 14.6 s for PCB00 respectively. The number of cases with IOL manipulation with a second instrument was 6 for MX60, 2 for ZCB00, 0 for SN60 WF, NC60, and PCB00. Amount of OVD pushed into a porcine eye was smaller with a preloaded system than with non-preloaded systems. CONCLUSION： IOL delivery with preloaded systems is faster and more predictable. Moreover, a preloaded delivery system shows relatively less OVD pushed into a porcine eye than non-preloaded systems.

The Principle and Reflection on Determining the Mails' Whole Delivery Standard of Time Bound in the Postal Central Office System

This paper analyzes some problems arising in determining the mails Whole Delivery Standard of Time Bound ( WDSTB ) at present, and further on the basis of the postal central office system currently in practice, puts forward the principle, reflection and the concrete approaches in determining the Delivery Standard of Time Bound ( DSTB ).

Heuristic algorithms for scheduling on uniform parallel machines with heads and tails

This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time.For this NP-hard problem,the largest sum of release date,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is built.To evaluate the performance of the proposed algorithm,a lower bound for the problem is proposed.The accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 jobs.The computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.

Design and experimental study of seed precise delivery mechanism for high-speed maize planter

Aiming at improving the seed spacing uniformity of maize planter at high forward speed,a seed precise delivery mechanism driven by electric motor has been developed and evaluated in laboratory.The mechanism was designed to deliver single seed from seed meter to furrow.Seed’s movement from the seed release point in a seed meter to the seed delivery cavity in the belt was analyzed,the mathematical model of seed movement in the seed precise delivery mechanism was established based on seed delivery time analysis.A mechanical prototype was designed and associated control system was developed.The performance contrast experiment was conducted between a traditional seed tube and newly developed seed precise delivery mechanism,and test results indicated that the qualities of feed index of the seed precise delivery mechanism were higher than those of the traditional seed tube delivery mechanism,and the coefficients of variation of the seed precise delivery mechanism were lower than those of the traditional seed tube delivery mechanism when the forward speed of planter was set at 10 km/h,12 km/h and 14 km/h,respectively.It indicated the seed precise delivery mechanism significantly improved seed spacing uniformity of maize planter compared with the traditional seed tube delivery mechanism.

Performance improvement of licklider transmission protocol in complex deep space networks based on parameter optimization

A reasonable parameter configuration helps improve the data transmission performance of the Licklider Transmission Protocol(LTP).Previous research has focused mainly on parameter optimization for LTP in simplified scenarios with one to two hops or multihop scenarios with a custody mechanism of the Bundle Protocol(BP).However,the research results are not applicable to communications in Complex Deep Space Networks(CDSNs)without the custody mechanism of BP that are more suitable for deep space communications with LTP.In this paper,we propose a model of file delivery time for LTP in CDSNs.Based on the model,we propose a Parameter Optimization Design Algorithm for LTP(LTP-PODA)of configuring reasonable parameters for LTP.The results show that the accuracy of the proposed model is at least 6.47%higher than that of the previously established models based on simple scenarios,and the proposed model is more suitable for CDSNs.Moreover,the LTP parameters are optimized by the LTP-PODA algorithm to obtain an optimization plan.Configuring the optimization plan for LTP improves the protocol transmission performance by at least 18.77%compared with configuring the other parameter configuration plans.

Modeling in-network caching and bandwidth sharing performance in information-centric networking

Information-centric networking （ICN） proposes a content-centric paradigm which has some attractive advantages, such as network load reduction, low dissemination latency, and energy efficiency. In this paper, based on the analytical model of ICN with receiver-driven transport protocol employing least-recently used （LRU） replacement policy, we derive expressions to compute the average content delivery time of the requests＇ arrival sequence of a single cache, and then we extend the expressions to a cascade of caches＇ scenario. From the expressions, we know the quantitative relationship among the delivery time, cache size and bandwidth. Our results, analyzing the trade-offs between performance and resources in ICN, can be used as a guide to design ICN and to evaluation its performance.