Machine maintenance with workload considerations

Machine maintenance is modeled in the setting of a single‐server queue. Machine deterioration corresponds to slower service rates and failure. This leads to higher congestion and an increase in customer holding costs. The decision‐maker decides when to perform maintenance, which may be done pre‐emptively; before catastrophic failures. Similar to classic maintenance control models, the information available to the decision‐maker includes the state of the server. Unlike classic models, the information also includes the number of customers in queue. Considered are both a repair model and a replacement model. In the repair model, with random replacement times, fixed costs are assumed to be constant in the server state. In the replacement model, both constant and variable fixed costs are considered. It is shown in general that the optimal maintenance policies have switching curve structure that is monotone in the server state. However, the switching curve policies for the repair model are not always monotone in the number of customers in the queue. Numerical examples and two heuristics are also presented. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Colombian Military Thinking and the Fight against the FARC-EP Insurgency, 2002–2014

This article attempts to place in historical perspective the latest effort by Colombia’s military (Colmil) to defeat the now half century old insurgency of the Fuerzas Armadas Revolucionarias de Colombia – Ejército del Pueblo (FARC-EP). It argues that the ‘surge’ initiated under President Álvaro Uribe in 2002 with the assistance of the United States can only be fully analyzed in the context of the Colmil’s intellectual framework for counter-insurgency. Specifically, this article will explain how the protracted engagement with counter-insurgency has shaped the Colmil’s understanding of the nature of the conflict, as well as its attitudes towards its adversary, civil authority and the instrumentality of force. An understanding of the Colmil’s strategic tradition can also help to explain their apprehensions about the ongoing peace negotiations with the FARC-EP.     

Mandated defence offsets: can they ever deliver?

Defence offsets are elements of defence procurement deals additional to the primary content. Offsets are usually expected to yield technological or industrial benefits to the purchasing country (e.g. countertrade, technology transfers, or additional jobs) and military buyers often require suppliers to make offsets available “cost-free.” The authors argued previously that such strategies achieve little of value to buyers that lack market power and are unnecessary otherwise, since purchasers with the market power to extract more value for money from foreign suppliers can do so anyway. This article also focuses on the supply side of offset deals. The USA is the world's largest defence offsets supplier but the US government opposes offsets demands as economically inefficient and trade distorting. Even if offsets are inefficient and trade distorting, they may still benefit a materiel-exporting country such as the USA as they may induce exports and create associated benefits for the offsets provider.     

境外行政主体制度研究

行政主体理论自行政法成为公法重要组成部分时便成为行政法几个核心理论之一。自《中华人民共和国行政诉讼法》实施以来,行政主体理论研究成为我国行政法理论研究的重点之一。我国关于行政主体的内涵及外延,学术界各抒己见,至今缺乏统一的论断。境外一些行政法理论发达国家和地区的行政主体制度对于我们具有借鉴意义。     

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.     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000