900 resultados para Hard combinatorial scheduling


Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Goal evaluation is an essential element of the process of designing regulatory frameworks. Lawyers and legal scholars do however tend to ignore it. The present paper stresses the importance of pinpointing the precise regulatory objectives in the fluid environment of electronic communications, since, due to their technological and economic development, they have become the vital basis for communication and distribution of information in modern societies. The paper attempts an analysis of the underlying regulatory objectives in contemporary communications and seeks to put together the complex puzzle of economic and societal issues.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Due to the ongoing trend towards increased product variety, fast-moving consumer goods such as food and beverages, pharmaceuticals, and chemicals are typically manufactured through so-called make-and-pack processes. These processes consist of a make stage, a pack stage, and intermediate storage facilities that decouple these two stages. In operations scheduling, complex technological constraints must be considered, e.g., non-identical parallel processing units, sequence-dependent changeovers, batch splitting, no-wait restrictions, material transfer times, minimum storage times, and finite storage capacity. The short-term scheduling problem is to compute a production schedule such that a given demand for products is fulfilled, all technological constraints are met, and the production makespan is minimised. A production schedule typically comprises 500–1500 operations. Due to the problem size and complexity of the technological constraints, the performance of known mixed-integer linear programming (MILP) formulations and heuristic approaches is often insufficient. We present a hybrid method consisting of three phases. First, the set of operations is divided into several subsets. Second, these subsets are iteratively scheduled using a generic and flexible MILP formulation. Third, a novel critical path-based improvement procedure is applied to the resulting schedule. We develop several strategies for the integration of the MILP model into this heuristic framework. Using these strategies, high-quality feasible solutions to large-scale instances can be obtained within reasonable CPU times using standard optimisation software. We have applied the proposed hybrid method to a set of industrial problem instances and found that the method outperforms state-of-the-art methods.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Firms aim at assigning qualified and motivated people to jobs. Human resources managers often conduct assessment centers before making such personnel decisions. By means of an assessment center, the potential and skills of job applicants can be assessed more objectively. For the scheduling of such assessment centers, we present a formulation as a mixed-binary linear program and report on computational results for four real-life examples.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The production of W bosons in association with two jets in proton-proton collisions at a centre-of-mass energy of root s = 7 TeV has been analysed for the presence of double-parton interactions using data corresponding to an integrated luminosity of 36 pb(-1), collected with the ATLAS detector at the Large Hadron Collider. The fraction of events arising from double-parton interactions, f(DP)((D)), has been measured through the p(T) balance between the two jets and amounts to f(DP)((D)) = 0.08 +/- 0.01 (stat.) +/- 0.02 (sys.) for jets with transverse momentum p(T) > 20 GeV and rapidity vertical bar y vertical bar < 2.8. This corresponds to a measurement of the effective area parameter for hard double-parton interactions of sigma(eff) = 15 +/- 3 (stat.)(-3)(+5) (sys.) mb.