首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   211篇
  免费   2篇
管理学   94篇
人口学   2篇
丛书文集   9篇
理论方法论   5篇
综合类   57篇
社会学   4篇
统计学   42篇
  2021年   2篇
  2020年   2篇
  2019年   7篇
  2018年   2篇
  2017年   12篇
  2016年   6篇
  2015年   13篇
  2014年   6篇
  2013年   41篇
  2012年   9篇
  2011年   12篇
  2010年   4篇
  2009年   17篇
  2008年   6篇
  2007年   13篇
  2006年   11篇
  2005年   5篇
  2004年   9篇
  2003年   6篇
  2002年   3篇
  2001年   4篇
  1999年   3篇
  1998年   1篇
  1996年   2篇
  1995年   1篇
  1994年   4篇
  1993年   2篇
  1992年   1篇
  1991年   1篇
  1990年   2篇
  1989年   2篇
  1987年   2篇
  1986年   2篇
排序方式: 共有213条查询结果,搜索用时 15 毫秒
51.
科技资源是第一资源 ,对西部地区来说更是如此 ,如何充分发挥资本在科技资源配置中的作用 ,如何在有限的生产要素中有选择地进行最合理的投入 ,以使投入产出达到最大 ,本文通过数学模型的建立给出一些参考意见。  相似文献   
52.
The authors (Tang et al. (2013) [1] developed a CoFAQ model to formulate a solution for the problem of production strategy decision and reuse scenario selection for a software product family. In the previous research, we stated that the CoFAQ model was a 0–1 mixed integer nonlinear program, where only a local optimal solution might be found. In a recent study, we found that the CoFAQ could be transformed into a 0–1 mixed integer linear programming model. By solving the model, a global optimal solution can be obtained. In this paper, we present the improved formulation and the optimal solution for the case study.  相似文献   
53.
通过审视当前服务外包业的发展趋势,对长江三角洲地区发展服务外包的自身优势、劣势及长三角环境机遇、挑战进行简略分析,提出优化建议。  相似文献   
54.
It is desired to draw a random sample containing specified numbers of individuals from each stratum of a population. First a random sample of size N is chosen from the whole populations and the stratum of each individual ascertained; then any shortfall is made up by selecting individuals with known stratum affiliation. Optimal values of N are sought allowing for cost structure and also the possibility of error in ascertaining the strata to which individuals in the first sample belong.  相似文献   
55.
Backsolving is a class of methods that generate simulated values for exogenous forcing processes in a stochastic equilibrium model from specified assumed distributions for Euler-equation disturbances. It can be thought of as a way to force the approximation error generated by inexact choice of decision rule or boundary condition into distortions of the distribution of the exogenous shocks in the simulations rather than into violations of the Euler equations as with standard approaches. Here it is applied to a one-sector neoclassical growth model with decision rule generated from a linear-quadratic approximation.  相似文献   
56.

In this paper, we investigate the effect of the warranty cost on optimization of the economic manufacturing quality (EMQ). This is done for a deteriorating process where the production process shifts from the in-control state to the out-of-control state following a general discrete probability distribution. Once the production process goes out of control, the production process produces some defective items. The defective item cost includes reworking and warranty costs. Thus, in order to economically operate a production-inventory system with products sold under warranty, the tradeoffs among the production setup, inventory, and defective item cost, including the reworked cost before sale and the warranty cost after sale, needed to be analysed. This objective in this paper is to determine the production lot size while minimizing the total cost per unit of time per unit of time. Various special cases are presented. Two of them are extensions of results obtained previously in the literature. Finally, a numerical example is given which uses a discrete Weibull probability distribution. Sensitivity analysis of the model with respect to cost and time parameters is also performed.  相似文献   
57.

In this paper, we model an apparel manufacturing system characterized by the co-existence of the two production lines, i.e. traditional, long lead time production line and flexible, short lead time production line. Our goal is to find strategies which decide: (i) the fraction of the total production capacity to be allocated to each individual line, and (ii) the production schedules so as to maximize the overall profits. In this problem, searching for the best solution is prohibited in view of the tremendouscomputing budget involved. Using ordinal optimization ideas, we obtained very encouraging results not only have we achieved a high proportion of 'good enough' designs but also tight profit margins compared to a pre-calculated upper bound. There is also a saving of at least 1/2000 of the computation time.  相似文献   
58.

Fundamental and extended multi-objective (MO) models are designed to address earliness/tardiness production scheduling planning (ETPSP) problems with multi-process capacity balance, multi-product production and lot-size consideration. A canonical genetic algorithm (GA) approach and a prospective multi-objective GA (MOGA) approach are proposed as solutions for different practical problems. Simulation results as well as comparisons with other techniques demonstrate the effectiveness of the MOGA approach, which is a noted improvement to any of the existing techniques, and also in practice provides a new trend of integrating manufacturing resource planning (MRPII) with just-in-time (JIT) in the production planning procedure.  相似文献   
59.

This research presents a variation to the permutation flow shop problem where Just In Time (JIT) production requirements are taken into account. The model developed in this research employs dual objectives. In addition to the traditional objective of minimizing the production makespan, minimization of Miltenburg's material usage rate is also incorporated. In this model, multiple units of any product are permitted in the production sequence. However, the minimization of material usage rates attempts to prevent batch scheduling of products and allows unit flow of products as required in demand flow manufacturing. A solution method is proposed for determining an optimal production sequence via an efficient frontier approach and Simulated Annealing (SA). Test problems and specific performance criteria are used to assess the solutions generated by the proposed method. Experimental results presented in this paper show that the use of the efficient frontier and SA provide solutions that approach the optimal solution for the performance measures used in this research.  相似文献   
60.
We develop a new genetic algorithm to solve an integrated Equipment-Workforce-Service Planning problem, which features extremely large scales and complex constraints. Compared with the canonical genetic algorithm, the new algorithm is innovative in four respects: (1) The new algorithm addresses epistasis of genes by decomposing the problem variables into evolutionary variables, which evolve with the genetic operators, and the optimization variables, which are derived by solving corresponding optimization problems. (2) The new algorithm introduces the concept of Capacity Threshold and calculates the Set of Efficient and Valid Equipment Assignments to preclude unpromising solution spaces, which allows the algorithm to search much narrowed but promising solution spaces in a more efficient way. (3) The new algorithm modifies the traditional genetic crossover and mutation operators to incorporate the gene dependency in the evolutionary procedure. (4) The new algorithm proposes a new genetic operator, self-evolution, to simulate the growth procedure of an individual in nature and use it for guided improvements of individuals. The new genetic algorithm design is proven very effective and robust in various numerical tests, compared to the integer programming algorithm and the canonical genetic algorithm. When the integer programming algorithm is unable to solve the large-scale problem instances or cannot provide good solutions in acceptable times, and the canonical genetic algorithm is incapable of handling the complex constraints of these instances, the new genetic algorithm obtains the optimal or close-to-optimal solutions within seconds for instances as large as 84 million integer variables and 82 thousand constraints.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号