890 resultados para static priority scheduling
Resumo:
We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables
Resumo:
In high intensity and high gradient magnetic fields the volumetric force on diamagnetic material, such as water, leads to conditions very similar to microgravity in a terrestrial laboratory. In principle, this opens the possibility to determine material properties of liquid samples without wall contact, even for electrically non-conducting materials. In contrast, AC field levitation is used for conductors, but then terrestrial conditions lead to turbulent flow driven by Lorentz forces. DC field damping of the flow is feasible and indeed practiced to allow property measurements. However, the AC/DC field combination acts preferentially on certain oscillation modes and leads to a shift in the droplet oscillation spectrum.What is the cause? A nonlinear spectral numerical model is presented, to address these problems.
Resumo:
We consider the problem of scheduling families of jobs in a two-machine open shop so as to minimize the makespan. The jobs of each family can be partitioned into batches and a family setup time on each machine is required before the first job is processed, and when a machine switches from processing a job of some family to a job of another family. For this NP-hard problem the literature contains (5/4)-approximation algorithms that cannot be improved on using the class of group technology algorithms in which each family is kept as a single batch. We demonstrate that there is no advantage in splitting a family more than once. We present an algorithm that splits one family at most once on a machine and delivers a worst-case performance ratio of 6/5.
Resumo:
We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be formulated as a polymatroid optimization problem. We develop a novel divide-and-conquer technique for the polymatroid optimization problem and then apply it to each scheduling problem. We show that each scheduling problem can be solved in $ \O({\rm T}_{\rm feas}(n) \times\log n)$ time by using our divide-and-conquer technique, where n is the number of jobs and Tfeas(n) denotes the time complexity of the corresponding feasible scheduling problem with n jobs. This approach yields faster algorithms for most of the scheduling problems discussed in this paper.
Resumo:
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenario in which some portion of the processing is repeated but the job is otherwise resumable. For the problem with several non-availability intervals on the first machine under the resumable scenario, we present a fast (3/2)-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, a polynomial-time approximation scheme is developed.
Resumo:
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two-machine problem is NP-hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst-case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple-choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008
Resumo:
We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.
Resumo:
Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid-1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms and enhanced scheduling models.
Resumo:
In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan.
Resumo:
An innovative methodology has been used for the formulation development of Cyclosporine A (CyA) nanoparticles. In the present study the static mixer technique, which is a novel method for producing nanoparticles, was employed. The formulation optimum was calculated by the modified Shepard's method (MSM), an advanced data analysis technique not adopted so far in pharmaceutical applications. Controlled precipitation was achieved injecting the organic CyA solution rapidly into an aqueous protective solution by means of a static mixer. Furthermore the computer based MSM was implemented for data analysis, visualization, and application development. For the optimization studies, the gelatin/lipoid S75 amounts and the organic/aqueous phase were selected as independent variables while the obtained particle size as a dependent variable. The optimum predicted formulation was characterized by cryo-TEM microscopy, particle size measurements, stability, and in vitro release. The produced nanoparticles contain drug in amorphous state and decreased amounts of stabilizing agents. The dissolution rate of the lyophilized powder was significantly enhanced in the first 2 h. MSM was proved capable to interpret in detail and to predict with high accuracy the optimum formulation. The mixer technique was proved capable to develop CyA nanoparticulate formulations.
Resumo:
Rule testing in transport scheduling is a complex and potentially costly business problem. This paper proposes an automated method for the rule-based testing of business rules using the extensible Markup Language for rule representation and transportation. A compiled approach to rule execution is also proposed for performance-critical scheduling systems.
Resumo:
The rise of food security up international political, societal and academic agendas has led to increasing interest in novel means of improving primary food production and reducing waste. There are however, also many 'post-farm gate' activities that are critical to food security, including processing, packaging, distributing, retailing, cooking and consuming. These activities all affect a range of important food security elements, notably availability, affordability and other aspects of access, nutrition and safety. Addressing the challenge of universal food security, in the context of a number of other policy goals (e.g. social, economic and environmental sustainability), is of keen interest to a range of UK stakeholders but requires an up-to-date evidence base and continuous innovation. An exercise was therefore conducted, under the auspices of the UK Global Food Security Programme, to identify priority research questions with a focus on the UK food system (though the outcomes may be broadly applicable to other developed nations). Emphasis was placed on incorporating a wide range of perspectives ('world views') from different stakeholder groups: policy, private sector, non-governmental organisations, advocacy groups and academia. A total of 456 individuals submitted 820 questions from which 100 were selected by a process of online voting and a three-stage workshop voting exercise. These 100 final questions were sorted into 10 themes and the 'top' question for each theme identified by a further voting exercise. This step also allowed four different stakeholder groups to select the top 7-8 questions from their perspectives. Results of these voting exercises are presented. It is clear from the wide range of questions prioritised in this exercise that the different stakeholder groups identified specific research needs on a range of post-farm gate activities and food security outcomes. Evidence needs related to food affordability, nutrition and food safety (all key elements of food security) featured highly in the exercise. While there were some questions relating to climate impacts on production, other important topics for food security (e.g. trade, transport, preference and cultural needs) were not viewed as strongly by the participants.
Resumo:
United Kingdom (UK) and European Union policy is rapidly developing to meet international targets for the sustainable use and protection of the marine environment. To inform this process, research needs to keep pace with these changes and research questions must be focused on providing robust scientific evidence. Thirty four priority research questions within six broad themes were identified by delegates who attended the 1st marine and coastal policy Forum, hosted by the Centre for Marine and Coastal Policy Research at Plymouth University in June 2011. The priority questions formed through this research are timely and reflect the pace and change of marine policy in the UK in response to international, European and national policy drivers. Within the data theme, the majority of questions seek to find improved procedures to manage and use data effectively. Questions related to governance focus on how existing policies should be implemented. The marine conservation questions focus entirely upon implementation and monitoring of existing policy. Questions related to ecosystem services focus on research to support the conceptual links between ecosystem services, ecosystem function, and marine management. Questions relating to marine citizenship are fundamental questions about the nature of societal engagement with the sea. Finally, the marine planning questions focus upon understanding the general approaches to be taken to marine planning rather than its detailed implementation. The questions that have emerged from this process vary in scale, approach and focus. They identify the interdisciplinary science that is currently needed to enable the UK to work towards delivering its European and international commitments to achieve the sustainable use and protection of the marine environment
Resumo:
Tropical marginal seas (TMSs) are natural subregions of tropical oceans containing biodiverse ecosystems with conspicuous, valued, and vulnerable biodiversity assets. They are focal points for global marine conservation because they occur in regions where human populations are rapidly expanding. Our review of 11 TMSs focuses on three key ecosystems—coral reefs and emergent atolls, deep benthic systems, and pelagic biomes—and synthesizes, illustrates, and contrasts knowledge of biodiversity, ecosystem function, interaction between adjacent habitats, and anthropogenic pressures. TMSs vary in the extent that they have been subject to human influence—from the nearly pristine Coral Sea to the heavily exploited South China and Caribbean Seas—but we predict that they will all be similarly complex to manage because most span multiple national jurisdictions. We conclude that developing a structured process to identify ecologically and biologically significant areas that uses a set of globally agreed criteria is a tractable first step toward effective multinational and transboundary ecosystem management of TMSs.