1,720,991 research outputs found
Optimal assignment of slack due-date and sequencing in a single machine shop
No full textAbstractThis paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the result given by Cheng [2] on this problem is incorrect and we give the correct answer to this problem
Computing the principal eigenpairs using the Davidson's method
No full textWe discuss the generalized Davidson's algorithm for computing accurate approximations of the k principal eigenpairs of a large, sparse, and symmetric n x n matrix. Our implementation of the iterative algorithm in the Matlab language is based on the pseudocode given in [2]. We improve the algorithm by including a stopping criterion that allows the user to specify the accuracy of the approximations, and by including a test to make sure the approximations indeed approximate the correct eigenpairs. Our profile of the algorithm suggests that our implementation is essentially optimal for PCs, subject to the preconditioner used to compute the new search direction in each iteration. We compare the generalized Davidson's algorithm to a recent algorithm called Algorithm Keig. Key Words: Eigenvalue, eigenvector, eigenpair, Ritz pair, symmetric, tridiagonal, sparse, Lanczos procedure
A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
No full text
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
No full textAbstract Inthispaper,weproposeacriticaleventtabusearchmeta-heuristicforthegeneral integer multidimensional knapsack problem (GMDKP). Variations of GMDKP have enormousapplications,andoftenoccurasasub-problemofmoregeneralcombinatorialproblems. Forthespecialcaseofbinarymultidimensionalknapsackproblems(BMDKP)therearevariety of heuristics, mostly sophisticated meta-heuristics, which provides good solutions to the problem.However,todatethereisnomethodthatcanprovidereasonablesolutionstorealisticsizeGMDKP.Tothebestofourknowledgethereareonlythreeheuristicspublishedinthe literature for GMDKP, and all three are simple greedy heuristics. There is no meta-heuristic available that effectively provides good solutions for large-scale GMDKP. One successful meta-heuristicthathasproventobehighlyeffectiveinsolvingcombinatorialoptimizationis a variation of tabu search known as the critical event tabu search (CETS). CETS was originally proposed for the BMDKP with considerable success afterwards. In CETS, clever use of surrogate programming is embedded as choice rules to obtain high quality solutions. The mainpurposeofthispaperistodesignthemeta-heuristicCETSfortheGMDKPusingvariety ofdifferentsurrogatechoicerules.Extensivecomputationalexperimentforlarge-scaleprob
The multi-floor cross-dock door assignment problem: Rising challenges for the new trend in logistics industry
No full textThis paper is concerned with the multi-floor, cross-dock door assignment problem (MCDAP) to minimize the total material handling costs. We present a novel mixed-integer nonlinear programming model and a classic linearization form for the MCDAP. We use a combination of multi-start, genetic random-key, and very-large-scale neighborhood search (VLSN) as the diversification strategies for the solution perturbation method embedded within the critical event Tabu search to solve MCDAP. We will test the proposed algorithms on a set of 60 very-large sized instances with 150–300 loading doors, and 100–300 unloading doors that raise size of cost matrix up to 90,000 by 90,000
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
- …
