Robust job-sequencing with an uncertain flexible maintenance activity

In this study, the problem of scheduling a set of jobs and one uncertain maintenance activity on a single machine, with the objective of minimizing the makespan is addressed. The maintenance activity has a given duration and must be executed within a given time window. Furthermore, duration and time window of the maintenance are uncertain, and can take different values which can be described by different scenarios. The problem is to determine a job sequence which performs well, in terms of makespan, independently on the possible variation of the data concerning the maintenance. A robust scheduling approach is used for the problem, in which four different measures of robustness are considered, namely, maximum absolute regret, maximum relative regret, worst-case scenario, and ordered weighted averaging. Complexity and approximation results are presented. In particular, we show that, for all the four robustness criteria, the problem is strongly NP-hard. A number of special cases are explored, and an exact pseudopolynomial algorithm based on dynamic programming is devised when the number of scenarios is fixed. Two Mixed Integer Programming (MIP) models are also presented for the general problem. Several computational experiments have been conducted to evaluate the efficiency and effectiveness of the MIP models and of the dynamic programming approach

Equilibrium in a two-agent assignment problem

In this paper we address a particular generalisation of the Assignment Problem (AP) in a Multi-Agent setting, where distributed agents share common resources. We consider the problem of determining Pareto-optimal solutions that satisfy a fairness criterion (equilibrium). We show that the solution obtained is equivalent to a Kalai Smorodinsky solution of a suitably defined bargaining problem and characterise the computational complexity of finding such an equilibrium. Additionally, we propose an exact solution algorithm based on a branch-and-bound scheme that exploits bounds obtained by suitably rounding the solutions of the corresponding linear relaxation, and give the results of extensive computational experiments. Copyright © 2009, Inderscience Publishers

Assessment of real-time operative torque during nickel-titanium instrumentation with different lubricants

The aim of the present study is twofold: to assess ex vivo the role of different lubricants on real-time torque generated during intracanal instrumentation and to check whether two different kinds of torque parameters, operative torque (OT) and average peak torque (APT), could produce similar results. Forty extracted single-rooted teeth were selected for the present study and divided into four equal groups (n = 10): Group A, NaCl 0.2%; Group B, NaOCl 5%; Group C, ethylenediaminetetraacetate (EDTA), and Group D, EDTA and hydrogen peroxide. Afterwards, Edge Taper F2 (Edge Endo, Albuquerque, New Mexico) were rotated clockwise at 300 rpm with 3 Ncm maximum torque by an endodontic torque recording motor. In each sample, mean OT and mean APT were recorded and statistically analyzed with one-way ANOVA and a post hoc Bonferroni between groups (p < 0.05). EDTA (12.11 ± 4.45 Ncm) showed statistically significant (p < 0.05) lower values compared with the other tested irrigant for both parameters. Overall, the two different parameters were both able to differentiate between the influence of lubricants on torsional loads

Two is better than one? Order aggregation in a meal delivery scheduling problem

We address a single-machine scheduling problem motivated by a last-mile-delivery setting for a food company. Customers place orders, each characterized by a delivery point (customer location) and an ideal delivery time. An order is considered on time if it is delivered to the customer within a time window given by the ideal delivery time , where is the same for all orders. A single courier (machine) is in charge of delivery to all customers. Orders are either delivered individually, or two orders can be aggregated in a single courier trip. All trips start and end at the restaurant, so no routing decisions are needed. The problem is to schedule courier trips so that the number of late orders is minimum. We show that the problem with order aggregation is -hard and propose a combinatorial branch and bound algorithm for its solution. The algorithm performance is assessed through a computational study on instances derived by a real-life application and on randomly generated instances. The behavior of the combinatorial algorithm is compared with that of the best ILP formulation known for the problem. Through another set of computational experiments, we also show that an appropriate choice of design parameters allows to apply the algorithm to a dynamic context, with orders arriving over time

On the regularity of a graph related to conjugacy classes of groups

AbstractGiven a finite group G, denote by Γ(G) the simple undirected graph whose vertices are the (distinct) non-central conjugacy class sizes of G, and for which two vertices of Γ(G) are adjacent if and only if they are not coprime numbers. In this note we prove that Γ(G) is a 2-regular graph if and only if it is a complete graph with three vertices, and Γ(G) is a 3-regular graph if and only if it is a complete graph with four vertices

Optimum channel allocation in OFDMA multi-cell systems

This paper addresses the problem of allocating users to radio resources (i.e., sub-carriers) in the downlink of an OFDMA cellular system. We consider a classical multi-cellular environment with a realistic interference model and a margin adaptive approach, i.e., we aim at minimizing total transmission power while maintaining a certain given rate for each user. We discuss computational complexity issues of the resulting model and present a heuristic approach that finds optima under suitable conditions, or "reasonably good" solutions in the general case. Computational experiences show that, in a comparison with a commercial state-of-the-art optimization solver, our algorithm is quite effective in terms of both infeasibilities and transmitted powers and extremely efficient in terms of CPU times. © 2009 Springer Berlin Heidelberg

Integration of Internet and Telecommunications- An Architecture for Hybrid Services

In this article, we propose an architecture for hybrid services, i.e., services that span many network technologies, such as the Public Switched Telephone Network (PSTN), cellular networks and networks based on the Internet Protocol (IP). These services will play an important role in the future because they leverage on the existing infrastructures, rather than requiring new and sophisticated mechanisms to be deployed. We explore a few issues related to hybrid services and propose a platform, as well as a set of components, to facilitate their creation and deployment. The existing infrastructure is only required to generate specific events when requests for hybrid services are detected. We present the design of a service layer, based on Java, that handles the treatment of these special requests. Our service layer is provided with a set of generic components realized according to the JavaBeans model. We illustrate the strength of our architecture by discussing two hybrid-service examples: a calendar service and a call forwarding service

Use of dermal-fat grafts in the post-oncological reconstructive surgery of atrophies in the zygomatic region: Clinical evaluations in the patients undergone to previous radiation therapy

Introduction: Grafting of autologous adipose tissue can be recommended in some cases of facial plastic surgery. Rhabdomyosarcoma is a type of cancer that can also affect the orbit. Enucleation of the eye can cause atrophy of the corresponding hemiface and decreased orbital growth.Case report: We report a case of a female patient with a medical history of surgical enucleation of the right eyeball, who had received rhabdomyosarcoma radiation therapy in her youth. The patient presented with a depression in the right zygomatic region. We took a dermal-fat flap from the abdominal region, which had been previously treated.Results: The surgical outcome, 48 hours, and much clearly 31 days after the surgery, revealed that the right zygomatic region had returned to its proper anatomical shape, although there were still signs of postoperative edema.Discussion: Very damaged tissues, like those exposed to radiation therapy, are generally not suitable for grafting of adipose tissue.Conclusions: In the described case, we achieved a technically and aesthetically satisfying result despite the patient's medical history involving several perplexities about the use of autologous dermal-fat tissues, because of prior radiation therapy exposure. The clinical case shows that even a region exposed to radiation therapy can be a valid receiving bed for dermal-fat grafting. © 2012 Inchingolo et al.; licensee BioMed Central Ltd