Influence of porosity distribution on nonlinear free vibration and transient responses of porous functionally graded skew plates

This article deals with the investigation of the effects of porosity distributions on nonlinear free vibration and transient analysis of porous functionally graded skew (PFGS) plates. The effective material properties of the PFGS plates are obtained from the modified power-law equations in which gradation varies through the thickness of the PFGS plate. A nonlinear finite element (FE) formulation for the overall PFGS plate is derived by adopting first-order shear deformation theory (FSDT) in conjunction with von Karman’s nonlinear strain displacement relations. The governing equations of the PFGS plate are derived using the principle of virtual work. The direct iterative method and Newmark’s integration technique are espoused to solve nonlinear mathematical relations. The influences of the porosity distributions and porosity parameter indices on the nonlinear frequency responses of the PFGS plate for different skew angles are studied in various parameters. The effects of volume fraction grading index and skew angle on the plate’s nonlinear dynamic responses for various porosity distributions are illustrated in detail.     

Mitigation of the blast load effects on a building structure using newly composite structural configurations

In this study, a nonlinear three-dimensional hydrocode numerical simulation was carried out using AUTODYN-3D to investigate the effect of blasting of a high explosive material (TNT) against several configurations of the composite structure. Several numerical models were carried out to study the effect of varying the thickness of the walls and the effect of adding an air layer or aluminum foam layer inside two layers of concrete in mitigating the effect of blast waves on the structure walls. The results showed that increasing the thickness of walls has a good effect on mitigating the effect of blast waves. When a layer of air was added, the effect of blast waves was exaggerated, while when a layer of aluminum foam was added the blast wave effects were mitigated with a reasonable percentage.     

On‐line algorithms for minimizing makespan on batch processing machines

We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A batch machine can handle up to B jobs simultaneously. The jobs that are processed together from a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on‐line algorithms with worst‐case ratio (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst‐case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bound are given, and two on‐line algorithms are presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 241–258, 2001     

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.     

Legitimacy and the Politics of Recognition in Kosovo

Abstract

How do contemporary secessionist movements gain international recognition of their claims to self-determination? I argue that international recognition is forthcoming when a sufficient number of states believe a claim to self-determination ought to be accepted. That is, states recognize claims to self-determination when they perceive them to be legitimate. To convince outsiders of the legitimacy of their claims, separatist movements invoke resonant norms and symbols in a moral economy that structures decision-making. I contrast this argument with prevailing explanations of recognition dynamics. To illustrate the argument, I examine the diplomacy surrounding Kosovo’s independence bid and unilateral secession.     

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     

Expected waiting time rankings in extended machine-repair models

The present paper studies the relative magnitudes of expected waiting times in extended machine-repair models, when processing times are of two Erlang types. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 864–870, 1999     

General multiprocessor task scheduling

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one‐job‐on‐one‐machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocation, and manufacturing systems that may require several resources simultaneously to process a job, we study the problem with a one‐job‐on‐multiple‐machine model. In our model, there are several alternatives that can be used to process a job. In each alternative, several machines need to process simultaneously the job assigned. Our purpose is to select an alternative for each job and then to schedule jobs to minimize the completion time of all jobs. In this paper, we provide a pseudopolynomial algorithm to solve optimally the two‐machine problem, and a combination of a fully polynomial scheme and a heuristic to solve the three‐machine problem. We then extend the results to a general m‐machine problem. Our algorithms also provide an effective lower bounding scheme which lays the foundation for solving optimally the general m‐machine problem. Furthermore, our algorithms can also be applied to solve a special case of the three‐machine problem in pseudopolynomial time. Both pseudopolynomial algorithms (for two‐machine and three‐machine problems) are much more efficient than those in the literature. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 57–74, 1999