A model for manpower productivity during organization growth

A mathematical model is developed that enables organization and manpower planners to quantify the inefficiencies involved in rapid buildups of organizations, such as is frequently found in the aerospace industry shortly after the award of a major contract. Consideration is given to the time required to train, indoctrinate, and familiarize new workers with their jobs and the general program aspects. Once trained, workers are assumed to be productive. If the ratio of untrained to trained workers exceeds a critical value, called the buildup threshold, then the performance of the trained workers is degraded to the extent that they are no longer 100 percent efficient until this ratio returns to a value less than the threshold. The model is sufficiently general to consider an arbitrary manpower plan with more than one peak or valley. The model outputs are functions of real time and consist of the fraction of the total labor force which is productive, the fraction of the total labor units expended for nonproductive effort, the cumulative labor costs for productive effort, and the cumulative labor cost for all effort.     

基于改进匈牙利算法的多技能人员调度方法

人员的优化配置对于提高装备制造效率具有重要意义。针对经典匈牙利算法不能解决具有并联环节的人员指派问题的不足,提出利用虚拟工作代替并联环节,将问题转化为典型的指派问题;通过判断虚拟工作的可实现性,迭代搜索得到最优解。以某多技能人员任务指派系统为例,详细介绍了该优化方法的步骤。优化结果很好地验证了改进算法的有效性。     

COUP D'ÉTAT IN SÃO TOMÉ AND PRÍNCIPE

This paper argues for effective parliamentarian oversight of the expenditure of the security services. It discusses the general principles of public expenditure management and submits that, as the security services render a public service using public monies, they need to be subject to the same principles. The most important of these principles in relation to the security services are those of transparency and accountability. The security services are, however, involved in sensitive issues of state security and some modification in the application of these principles can be substantiated. Not detracting from the principles of public expenditure management and parliamentary oversight, special provisions regarding the management of security expenditure can be instituted. These include special legislation, the conduct of closed parliamentary committee meetings, and the institution of special parliamentary committees. The fundamental question is, however, ‘who decides’. The paper argues that the answer to this question lies squarely in the domain of parliament, which should ultimately decide on any deviations and exclusions from these principles as related to the security services.     

武警部队“忠诚卫士文化”建设历程探析

以《武警年鉴》原始资料为基础,从三个阶段简述武警部队“忠诚卫士文化”建设的历程：以武警部队重新组建为标志,忠诚卫士文化建设进入自发发展时期;以“中国武警十大忠诚卫士”评选为标志,忠诚卫士文化建设进入迅速发展时期;以《武警部队先进军事文化建设纲要》颁发为标志,忠诚卫士文化建设进入有意识地打造品牌的时期。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

A case study of gender and security sector reform in Zimbabwe

This article explores gender and security sector reform (SSR) in Zimbabwe from 2008 to the present. It firstly postulates that the purpose of gender-sensitive SSR is to transform security services so as to enhance human security, as opposed to having an exclusive focus on state and territorial security. A comprehensive analysis of the policy and legislative framework governing gender and SSR at the global, continental, sub-regional and national levels will be presented, followed by the argument that efforts to reform the partisan and oftentimes non-professional tendencies of the security sector – especially the Zimbabwe Defence Forces, Zimbabwe Republic Police, Central Intelligence Organisation and Zimbabwe Prison Services – to promote democracy have met with firm resistance. However, gender-sensitive SSR has made significant headway in Zimbabwe since it is considered less threatening by the government. It should be noted, nevertheless, that gender-sensitive SSR has the potential to shift levels of professionalism and accountability within the sector as well as change attitudes to enhance security at the personal and communal levels. The process can gradually increase the percentage of women serving in the security sector. In conclusion, recommendations are made to broaden and deepen gender-sensitive SSR as the only viable alternative in the current political environment in Zimbabwe.     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

We consider the problem of scheduling N jobs on M parallel machines so as to minimize the maximum earliness or tardiness cost incurred for each of the jobs. Earliness and tardiness costs are given by general (but job-independent) functions of the amount of time a job is completed prior to or after a common due date. We show that in problems with a nonrestrictive due date, the problem decomposes into two parts. Each of the M longest jobs is assigned to a different machine, and all other jobs are assigned to the machines so as to minimize their makespan. With these assignments, the individual scheduling problems for each of the machines are simple to solve. We demonstrate that several simple heuristics of low complexity, based on this characterization, are asymptotically optimal under mild probabilistic conditions. We develop attractive worst-case bounds for them. We also develop a simple closed-form lower bound for the minimum cost value. The bound is asymptotically accurate under the same probabilistic conditions. In the case where the due date is restrictive, the problem is more complex only in the sense that the set of initial jobs on the machines is not easily characterized. However, we extend our heuristics and lower bounds to this general case as well. Numerical studies exhibit that these heuristics perform excellently even for small- or moderate-size problems both in the restrictive and nonrestrictive due-date case. © 1997 John Wiley & Sons, Inc.     

Due‐window assignment with unit processing‐time jobs

In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Pirates – The Young and the Jobless: The Effect of Youth Bulges and Youth Labor Market Integration on Maritime Piracy

This article examines the impact of youth bulges and the lack of perspective of this cohort associated with the insufficient absorption of the labor market on the emergence of piracy acts. For a large panel data-set on maritime piracy and armed robbery against ships for the period 1990–2015 negative binomial regression results indicate that a large fraction of young people in a country increases the likelihood of piracy attacks originating from that country. Further, the piracy-driving effect is conditional on constrains in the labor market. It increases when the young population is insufficiently integrated into the labor market and becomes insignificant for high levels of labor force participation. The dearth of prospects seems to lower the inhibition to make a living from criminal activity.     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

Order-preserving allocation of jobs to two machines

In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed.     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relationships among pairs of jobs (whenever possible) and eliminates the first and the last few jobs in an optimal sequence. The remaining jobs are then ordered by incorporating the precedence relationships in a dynamic programming framework. Propositions are proved which considerably reduce the total computation involved in the dynamic programming phase. Computational results indicate that the solution time goes up less than linearly with the size (n) of the problem. The median solution time for solving 50 job problems was 0.36 second on UNIVAC 1108 computer.     

全球化时代的移民与国家安全：风险评估及其控制

移民具有经济、社会、政治等多重属性，其对国家安全的影响也涉及多个领域，且具有很强的不确定性。而地缘政治地位关键、领土存在国际争议、非劳动力要素供给缺乏弹性、族群认同超越国家认同和政府履行社会管理职能存在结构性缺陷等条件变量的作用，会显著增加移民的安全风险。这意味着控制移民安全风险的关键在于抑制或消除这些条件变量的作用。     

On n/1/F̄ dynamic deterministic problems

We consider sequencing of n jobs which will arrive intermittently and are to be processed on a single machine; the arrival and the processing times of each jobs are assumed known. A schedule is to be developed that minimizes the mean flow time. Two models are considered: (i) when no pre-emption or inserted idle time is allowed in the schedule, and (ii) when pre-emption is allowed but the jobs follow a pre-empt-repeat discipline We illustrate that Cobham's and Phipp's SPT dispatching rule does not guarantee the optimum F? even for the non-preemptive model We propose a branch and bound algorithm for both models and discuss our computational experience We also examine the relative performances of the optimum nonpre-emptive sequence, and the optimum pre-empt-repeat sequence over that resulting from SPT dispatching rule on a large number of sets of jobs of varying sizes and tightness.     

On the Determinants of Terrorism Risk Concern in Europe

We investigate whether differences in terrorism risk are mirrored on terrorism risk perception across European countries for the period 2003–2007. We find that the average propensity for terrorism risk concern is affected by actual risk levels. Country and individual heterogeneity contribute substantially to the variation of observed risk perception. Singles and individuals with white collar jobs are less likely to mention terrorism as one of the most pressing issues their country faces, while political positioning towards the right makes it more likely to be concerned about terrorism. As far as competing risks are concerned, we find that the likelihood terrorism is mentioned, decreases with spending on pensions as a percentage of GDP being higher. Finally, based on the Bayesian framework, we also examined the formation of terrorism risk perceptions, and decompose the observed country-level time series of terrorism activity into a long- and a short-run component. We concluded that the observed risk perception variation is only explained by the long-term trend of terrorism activity countries face.     

Optimal timing schedules in earliness-tardiness single machine sequencing

The article deals with a single machine earliness-tardiness scheduling model where idle times are permitted in job processing. Based on a cluster concept we develop properties of the model that lead to a very fast algorithm to find an optimal timing schedule for a given sequence of jobs. The performance of this algorithm is tested on 480 randomly generated problems involving 100, 200, 400 and 500 jobs. It takes less than two seconds to solve a 500 job problem on a PC. © 1995 John Wiley & Sons, Inc.     

Machine scheduling with an availability constraint and job delivery coordination

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007