14,520 research outputs found
Heart rate variability monitoring in the detection of central nervous system complications in children with enterovirus infection
A simple lower bound for total completion time minimization in a two-machine flowshop
[[abstract]]The purpose of this study is to present a simple lower bound to facilitate the development of branch-and-bound algorithms for the minimization of total completion time in a two-machine flowshop. The studied problem is known to be strongly NP-hard. In the literature, several lower bounds have been proposed. The bounding technique addressed in this paper is based upon a concept about rearrangement of the parameters of the input instance. The technique is intrinsically simple for computer implementations. We conduct computational experiments for problems with 10-65 jobs. Numerical results from our computational study indicate that the new scheme is very effective in reducing the execution time needed for composing optimal solutions.[[note]]SC
Bicriteria scheduling in a two-machine permutation flowshop
[[abstract]]In this paper we consider a production scheduling problem in a two-machine flowshop. The bicriteria objective is a linear combination or weighted sum of the makespan and total completion time. This problem is computationally hard because the special case concerning the minimization of the total completion time is already known to be strongly NP-hard. To find an optimal schedule, we deploy the Johnson algorithm and a lower bound scheme that was previously developed for total completion time scheduling. Computational experiments are presented to study the relative performance of different lower bounds. While the best known bound for the bicriteria problem can successfully solve test cases of 10 jobs within a time limit of 30 min, under the same setting our branch-and-bound algorithm solely equipped with the new scheme can produce optimal schedules for most instances with 30 or less jobs. The results demonstrate the convincing capability of the lower bound scheme in curtailing unnecessary branching during problem-solving sessions. The computational experience also suggests the practical significance and potential implications of this scheme.[[note]]SC
The SSC of the Generalised Jahangir’s Graph Jm,k and its Algebraic Characterizations
In this article, we present important combinatorial and algebraicproperties of spanning simplicial complex (SSC) of the generalised Jahangir’sgraph Jm,k. We describe the relation to find f−vectors associatedto Δs(Jm,k) and determine the Hilbert series for the SR-ring KΔs(Jm,k).In the end, we present the associated primes of the facet ideal IF(Δs(Jm,k))and the Cohen-Macaulay characterization of the SR-ring of Δs(Jm,k).AMS (MOS) Subject Classification Codes: Primary 13-P10, Secondary 13-F20, 13-C14, 13-H10.Corresponding Author: Agha KashifKey Words: Simplicial Complexes, f-vectors, Spanning Trees, Face Ring, Hilbert Series, CohenMacaulay
To <i>JM</i> on Its 75th Anniversary
This article discusses how Journal of Marketing ( JM) has influenced marketing science and practice by publishing articles on substantive topics relevant to customers, managers, organizations, markets, and society. The journal's 75th anniversary coincides with the 50th anniversary of the Marketing Science Institute (MSI). Frequently, JM and MSI have collaborated to address important substantive marketing issues identified in MSI's Research Priorities. The author highlights seminal articles on brand equity; business-to-business marketing (including sales force management); connecting marketing information, metrics, and strategy; consumer behavior; innovation, new product development. and product management; marketing orientation and capabilities; and market research, methodology and services. She also draws attention to articles that have won the Sheth Foundation/ JM Award and the H. Paul Root Award. The article describes how JM‘s knowledge dissemination is amplified by powerful social network effects. Ideas in JM articles diffuse through the business community, influencing the mind-set of managers worldwide. </jats:p
A simplified explanation for the frameshift mutation that created a novel C-terminal motif in the APETALA3 gene lineage.
An open, randomized, comparative study of clarithromycin and erythromycin in the treatment of children with community-acquired pneumonia.
- …
