共查询到20条相似文献,搜索用时 48 毫秒
1.
HOU Sixiang 《系统科学与复杂性》2002,(4)
We consider the problem of scheduling n jobs in a pallet-constrained flow shop so as to minimize the makespan. In such a flow shop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by a positive integer K ≤ n. Generally speaking, the optimal schedules may be passing schedules. In this paper, we present a combinatorial property which shows that for two machines, K(K ≥ 3) pallets, there exists a no-passing schedule which is an optimal schedule for n ≤2K-1 and 2K - 1 is tight. 相似文献
2.
Xiaoping WANG·Huan QI·Henghui XIAO·Xiaopan ZHANG Institute of Systems Engineering Huazhong University of Science Technology Wuhan China. Yang HU·Xiaojian FENG The Yangtze River Navigation Management Bureau Yichang China. 《系统科学与复杂性》2010,23(4):715-726
<正> This paper provides a mathematical model for Three Gorges-Gezhou dam co-schedulingproblem,based on full analysis of Three Gorges-Gezhou dam's actual needs,to maximize the totalthroughput of Three Gorges-Gezhou dam and the utilization ratio of shiplock area and minimize thetotal navigation shiplock waiting time under multiple constraints.This paper proposes a series queuingnetwork(SQN)scheduling algorithm to divide the total ships that intend to pass through the shiplocksinto four queues and calculate dynamically the weight of priority for each ship.The SQN schedulingalgorithm schedules ships according to their priority weights which is determined by the characteristicsof each ship,such as length,width,affiliation,waiting time,and so on.In the process,the operationconditions of Gezhou dam related to the navigable shiplocks and the task balancing among differentshiplocks also should be considered.The SQN algorithm schedules ships circularly and optimizes theresults step by step.Real operation data from our project shows that our SQN scheduling algorithmoutperforms the traditional manual scheduling in which the less computational time is taken,the areautilization ratio of the five shiplocks is increased,the waiting time of high-prioritized ships is shorten,and a better balanced and alternating run-mode is provided for the three shiplocks in the Gezhou dam. 相似文献
3.
Deadlock must be avoided in a manufacturing system. In this paper, an efficient algorithm for finding an optimal deadlock-free schedules in a manufacturing system with very limited buffer is presented. This algorithm is based on the effective genetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, some results of the structure analysis of Petri net are involved as a criterion to select deadlock-free schedule from the population generated by GA. The effectiveness and efficiency of the proposed approach is illustrated by using an example. 相似文献
4.
To improve the effect of destroying time-sensitive target (TST), a method of operational effectiveness evaluation is presented and some influential factors are analyzed based on the combat flow of system for destroying TST. Considering the possible operation modes of the system, a waved operation mode and a continuous operation mode are put forward at first. At the same time, some relative formulas are modified. In examples, the influential factors and operation modes are analyzed based on the system effectiveness. From simulation results, some design and operation strategies of the system for destroying time sensitive targets are concluded, which benefit to the improvement of the system effectiveness. 相似文献
5.
This paper studies the problem of primality testing for numbers of the form h · 2~n± 1,where h 2~n is odd, and n is a positive integer. The authors describe a Lucasian primality test for these numbers in certain cases, which runs in deterministic quasi-quadratic time. In particular, the authors construct a Lucasian primality test for numbers of the form 3 · 5 · 17 · 2~n± 1, where n is a positive integer, in half of the cases among the congruences of n modulo 12, by means of a Lucasian sequence with a suitable seed not depending on n. The methods of Bosma(1993), Berrizbeitia and Berry(2004), Deng and Huang(2016) can not test the primality of these numbers. 相似文献
6.
Wireless sensor networks promise a new paradigm for gathering data via collaboration among sensors spreading over a large geometrical region. Many applications impose delay requirements for data gathering and ask for time-efficient schedules for aggregating sensed data and sending to the data sink. In this paper, the authors study the minimum data aggregation time problem under collision-free transmission model. In each time round, data sent by a sensor reaches all sensors within its transmission range, but a sensor can receive data only when it is the only data that reaches the sensor. The goal is to find the method that schedules data transmission and aggregation at sensors so that the time for all requested data to be sent to the data sink is minimal. The authors propose a 7△/log2|s|+c, new approximation algorithm for this NP-hard problem with guaranteed performance ratio which significantly reduces the current best ratio of △- 1, where S is the set of sensors containing source data, A is the maximal number of sensors within the transmission range of any sensor, and e is a constant. The authors also conduct extensive simulation, the obtained results justify the improvement of proposed algorithm over the existing one. 相似文献
7.
The scheduling problem in surgery is difficult because, in addition of the planning of the operating rooms which are the most expensive resources in hospitals, each surgery requires a combination of human and material resources. In this paper, the authors address a surgery scheduling problem which arises in operated health care facility. Moreover, the authors consider simultaneously materiel and human resources. This problem is a three-stages flow shop scheduling environment. The first stage(war... 相似文献
8.
Computer experiments are constructed to simulate the behavior of complex physical systems. Uniform designs have good performance in computer experiments from several aspects. In practical use, the experimenter needs to choose a small size uniform design at the beginning of an experiment due to a limit of time, budget, resources, and so on, and later conduct a follow up experiment to obtain precious information about the system, that is, a sequential experiment. The Lee distance has been widely used in coding theory and its corresponding discrepancy is an important measure for constructing uniform designs. This paper proves that all the follow up designs of a uniform design are uniform and at least two of them can be used as optimal follow up experimental designs. Thus, it is not necessary that the union of any two uniform designs yields a uniform sequential design. Therefore, this article presents a theoretical justification for choosing the best follow up design of a uniform design to construct a uniform sequential design that involves a mixture of ω≥ 1 factors with β_k ≥ 2, 1 ≤ k ≤ωlevels. For illustration of the usage of the proposed results, a closer look is given at using these results for the most extensively used six particular cases, three symmetric and three asymmetric designs, which are often met in practice. 相似文献
9.
Lot sizing with non-zero setup times for rework 总被引:2,自引:1,他引:1
In this paper we consider a single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. In each cycle after the normal production of each product the machine is setup for the rework of the defectives of the same product and then the rework process starts. We assume that the setup time for the normal production process as well as the rework process is non-zero. Further we consider the waiting time cost of defectives for rework. This paper has two objectives. The first objective is to obtain the economic batch quantity (EBQ) for a single product. The second objective is to extend the result of the first objective to the multi-product case. Adopting the common cycle scheduling policy we obtain optimal batch sizes for each product such that the total cost of the system per unit time is minimized. 相似文献
10.
Fang Liu Jianyin Zhao Bo Guo 《系统科学与信息学报》2006,4(3):455-466
This paper describes the characteristics of a single-base repairable inventory system and multi-indenture structure with communality and redundancy. At the base, there are a working field that has a maximum of z equipment on line and its repair channels, which mainly consist of two centers: line replaceable units (LRUs) diagnostic center and shop replaceable units (SRUs) repair center. In these two centers, the resources are finite and different. We introduce routing probabilities to express the repair relationships between resources and failed replaced units. The diagnostic time follows exponential distribution and SRU repair time follows general distribution with known average. We analyze the general model of this system, and present an approximate solution that uses two-step negative binomial approximation to obtain the expected backorders of all LRUs. The first step is fitting negative binomial distributions to the distributions of the number for all SitUs at the repair center, and the second is fitting negative binomial distributions to the convolutions of the distributions of the number for all LRUs in diagnostic and assemblydelayed. Thus, we give the approximate value of operational awilability of equipment based on this method. Finally, the results under two policies of routing probabilities are compared by the optimal curves. 相似文献
11.
SYSTEMS ENGINEERING1. IMTSODUCTIONMachine scheduling problem is the study of constructing schedules of machine processing for a set of jobs inorder to ensure the execution of all jobs in a reasonable amount of time or cost. Usually, it deals with whatmachines to be allocated to which jobs and how to order the jobs in an appropriate processing sequence. Inparallel machine system, two machines are identical and a job can be processed by any one of the free machines.Each finished job … 相似文献
12.
MINIMIZING JOB SHOP INVENTORY WITH ON-TIME DELIVERY GUARANTEES 总被引:1,自引:0,他引:1
Leyuan SHI Yunpeng PANDepartment of Industrial Engineering University of Wisconsin University Ave. Madison WI USA 《系统科学与系统工程学报(英文版)》2003,12(4):449-469
In this paper, we introduce a new job shop model that minimizes a well-motivated inventory measure while assuring on-time job deliveries. For this new problem, we introduce precise notation and formalization. A decomposition scheme is discussed in detail, which is subsequently utilized in a new shifting bottleneck procedure (SBP) for the problem. In addition to SBP, we propose another heuristic method based on successive insertion of operations. Algorithms are fine tuned through experimentation. Moreover, the two heuristic procedures are compared in terms of computation time and solution quality, using disguised actual factory data. 相似文献
13.
COMPLEXITY ANALYSIS AND COMPUTATION OF THE OPTIMAL HARVESTING FOR ONE-SPECIES POPULATION RESOURCES 总被引:1,自引:0,他引:1
Haiying JING Zhaoyu YANG 《系统科学与复杂性》2006,19(4):517-526
The exploitation of renewable resources creates many complex problems for culture,ecologyand economics as well.Ascertaining the essentials behind the complex problems is very important.Inthis paper,we mainly study various complex relations appearing in the optimal exploitation processfor renewable resources.First, we derive a sufficient condition on the existence of optimal harvestingpolicies for one-species population resources.Then we present every possible optimal harvesting patternfor such a model.On the basis of this,we give a computing formula for estimating the optimal harvestingperiod,optimal transitional period,and optimal recruitment period.The main difference with respectto the previous works in literature is that our optimal harvesting policy is a piece-wise continuousfunction of time t,at the piecewise point t_c,which is called switching time.At the switching timewe switch the harvesting rate from h to some transitional control u_*,then to 0.Clearly this kind ofharvesting policy is easier to carry out than those by others,provided that there exists a managingdepartment which can highly supervise the resources. 相似文献
14.
Abstract Accurate forecast of future container throughput of a port is very important for its con struction, upgrading, and operation management. This study proposes a transfer forecasting model guided by discrete particle swarm optimization algorithm (TF-DPSO). It firstly transfers some related time series in source domain to assist in modeling the target time series by transfer learning technique, and then constructs the forecasting model by a pattern matching method called analog complexing. Finally, the discrete particle swarm optimization algorithm is introduced to find the optimal match between the two important parameters in TF-DPSO. The container throughput time series of two im portant ports in China, Shanghai Port and Ningbo Port are used for empirical analysis, and the results show the effectiveness of the proposed model. 相似文献
15.
Tao JIANG 《系统科学与信息学报》2018,(4)
This paper considers a discrete-time Geo/G/1 queue in a multi-phase service environment,where the system is subject to disastrous breakdowns, causing all present customers to leave the system simultaneously. At a failure epoch, the server abandons the service and the system undergoes a repair period. After the system is repaired, it jumps to operative phase i with probability qi, i = 1, 2 ···, n.Using the supplementary variable technique, we obtain the distribution for the stationary queue length at the arbitrary epoch, which are then used for the computation of other performance measures. In addition, we derive the expected length of a cycle time, the generating function of the sojourn time of an arbitrary customer, and the generating function of the server's working time in a cycle. We also give the relationship between the discrete-time queueing system to its continuous-time counterpart. Finally,some examples and numerical results are presented. 相似文献
16.
Task-oriented networked information system is an integrated information system which builds on multi-satellite networking to accomplish one or more tasks.In the background of emergency relief for applications,system working flow and response process are analyzed,and a timeliness effectiveness evaluation index system is constructed at multi-task level.The effectiveness is a measurement of promptness of information return.In evaluation process,system performance and tasks are associated,then an evaluation model based on efficacy function is established,and different evaluation criteria are selected for different tasks.A distributed simulation system is constructed,and the execution of task is decomposed.The simulation platform provides a comprehensive data source for evaluation.The results are easy to compare with each other,which reflects system time efficiency in different satellites networks and provides actual systems with basis and reference for design and application. 相似文献
17.
A price-setting newsvendor model under CVaR decision criterion with emergency procurement 总被引:1,自引:0,他引:1
Minghui Xu 《系统科学与系统工程学报(英文版)》2010,19(1):85-104
<正>In this paper,we consider a newsvendor model in which a risk-averse manager faces a stochastic price-dependent demand in either an additive or a multiplicative form.An emergency purchase option is allowed after the realization of demand to satisfy the units that are short.By adopting conditional value-at-risk(CVaR) as the decision criterion,we aim to investigate the optimal pricing and ordering decisions,and the effects of parameter changes in such a setting.We provide sufficient conditions for the uniqueness of the optimal policy for both demand models.We perform comparative statics analysis to show how the optimal pricing and ordering decision behaves when changing parameters.We also compare our results with those of the newsvendor with a general utility function and with CVaR criterion under lost sales assumption.Our key results include:(i) For both demand models,the optimal selling price is decreasing in risk aversion.Hence,the optimal price of a risk-averse newsvendor is not greater than the optimal price of a risk-neutral newsvendor.(ii) In contrary to the lost sales case,for the multiplicative demand model,the optimal order quantity may not be monotonic in risk aversion. Consequently,the optimal risk-averse order quantity may be lower or higher than the optimal risk-neutral counterpart.(iii) For the additive model,the optimal order quantity is strictly increasing in the emergency purchase price,while for the multiplicative model the optimal order quantity has no such a monotonic property.Some numerical examples are conducted to verify our claims and gain more insights about the risk-averse decision-making behaviors. 相似文献
18.
Ibrahim M.AL-HARKAN 《系统科学与系统工程学报(英文版)》2005,14(2):187-206
1.Introduction Production sequencing and scheduling is one of the most important activities in production planning and control.Sequencing is defined as the order in which the jobs are processed through the machines.The allocation of machines over time to process a collection of jobs is defined as Scheduling.Several methods have been developed to solve the scheduling problem which can be classified as follows:1)efficient optimal methods,2)implicit and explicit,or complete enumerative methods,a… 相似文献
19.
Let x_1,…, x_n be the life spans of n items. Suppose that we start the experi-ment at the time t=0 for all the items simultaneuously aud stop the experiment at the timet=r, where r is a stopping time. The observed data set is Z_n=(x_(1),…, x_(k), r(x)),where x_(i)(i=1,…, n) is the order statistic of x_i, i=1,…, n and k=k(x) is the num-ber of the observed data. Suppose that the distribution family of x_i, i=1,…, n is i.i.d.exponential with life expectation θ>0. For testing the hypothesis H_0: θ≤θ_0 againstH_1: θ>θ_0, we use the total time of experiment S_r=sub from i=1 to k x_(i) +(n-k)r (x) as the teststatistic. We reject H_0 as large value of S_r is observed. In this paper for a given stoppingtime r we construct a stopping time ro so that the resulting test is a best improvement ofthe one, which is based on r, in the sense that the power functions of the two tests are thesame but the test based on r_0 is the one which has the minimnm total experiment time. 相似文献
20.
This paper studies the property of the recursive sequences in the 3x+ 1 conjecture.The authors introduce the concept ofμfunction,with which the 3x + 1 conjecture can be transformed into two other conjectures:one is eventually periodic conjecture of theμfunction and the other is periodic point conjecture.The authors prove that the 3x + 1 conjecture is equivalent to the two conjectures above.In 2007,J.L.Simons proved the non-existence of nontrivial 2-cycle for the T function.In this paper,the authors prove that theμfunction has no l-periodic points for 2≤l≤12.In 2005, J.L.Simons and B.M.M de Weger proved that there is no nontrivial 2-cycle for the T function for l≤68,and in this paper,the authors prove that there is no nontrivial l-cycle for theμfunction for 2≤l≤102. 相似文献