Personnel scheduling using an integer programming model- an application at Avanti Blue-Nile Hotels.
Ontology highlight
ABSTRACT: Abstract
In this paper, we report perhaps a first of its kind application of management science in the Ethiopian hotel industry. Avanti Blue Nile Hotels, a newly established five star hotel in Bahir Dar, is the company for which we developed an integer programming model that determines an optimal weekly shift schedule for the Hotel's engineering department personnel while satisfying several constraints including weekly rest requirements per employee, rest requirements between working shifts per employee, required number of personnel per shift, and other constraints. The model is implemented on an excel solver routine. The model enables the company's personnel department management to develop a fair personnel schedule as needed and to effectively utilize personnel resources while satisfying several technical, legal and economic requirements. These encouraging achievements make us optimistic about the gains other Ethiopian organizations can amass by introducing management science approaches in their management planning and decision making systems.
SUBMITTER: Kassa BA
PROVIDER: S-EPMC3923920 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:This paper addressed a scheduling problem which handles urgent tasks along with existing schedules. The uncertainties in this problem come from random process of existing schedules and unknown upcoming urgent tasks. To deal with the uncertainties, this paper proposes a stochastic integer programming (SIP) based aggregated online scheduling method. The method is illustrated through a study case from the outpatient clinic block-wise scheduling system which is under a hybrid scheduling policy combining regular far-in-advance policy and the open-access policy. The COVID-19 pandemic brings more challenges for the healthcare system including the fluctuations of service time and increasing urgent requests which this paper is designed for. The schedule framework designed in the method is comprehensive to accommodate various uncertainties in the healthcare service system, such as: no-shows, cancellations and punctuality of patients as well as preference of patients over time slots and physicians. Supplementary Information The online version contains supplementary material available at 10.1007/s43069-021-00089-6.
| S-EPMC8390183 | biostudies-literature
Project description:MotivationSignal-transduction networks are often aberrated in cancer cells, and new anti-cancer drugs that specifically target oncogenes involved in signaling show great clinical promise. However, the effectiveness of such targeted treatments is often hampered by innate or acquired resistance due to feedbacks, crosstalks or network adaptations in response to drug treatment. A quantitative understanding of these signaling networks and how they differ between cells with different oncogenic mutations or between sensitive and resistant cells can help in addressing this problem.ResultsHere, we present Comparative Network Reconstruction (CNR), a computational method to reconstruct signaling networks based on possibly incomplete perturbation data, and to identify which edges differ quantitatively between two or more signaling networks. Prior knowledge about network topology is not required but can straightforwardly be incorporated. We extensively tested our approach using simulated data and applied it to perturbation data from a BRAF mutant, PTPN11 KO cell line that developed resistance to BRAF inhibition. Comparing the reconstructed networks of sensitive and resistant cells suggests that the resistance mechanism involves re-establishing wild-type MAPK signaling, possibly through an alternative RAF-isoform.Availability and implementationCNR is available as a python module at https://github.com/NKI-CCB/cnr. Additionally, code to reproduce all figures is available at https://github.com/NKI-CCB/CNR-analyses.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6129277 | biostudies-literature
Project description:Many educational testing programs require different test forms with minimal or no item overlap. At the same time, the test forms should be parallel in terms of their statistical and content-related properties. A well-established method to assemble parallel test forms is to apply combinatorial optimization using mixed-integer linear programming (MILP). Using this approach, in the unidimensional case, Fisher information (FI) is commonly used as the statistical target to obtain parallelism. In the multidimensional case, however, FI is a multidimensional matrix, which complicates its use as a statistical target. Previous research addressing this problem focused on item selection criteria for multidimensional computerized adaptive testing (MCAT). Yet these selection criteria are not directly transferable to the assembly of linear parallel test forms. To bridge this gap the authors derive different statistical targets, based on either FI or the Kullback-Leibler (KL) divergence, that can be applied in MILP models to assemble multidimensional parallel test forms. Using simulated item pools and an item pool based on empirical items, the proposed statistical targets are compared and evaluated. Promising results with respect to the KL-based statistical targets are presented and discussed.
| S-EPMC6906390 | biostudies-literature
Project description:MotivationCombinatorial therapies play increasingly important roles in combating complex diseases. Owing to the huge cost associated with experimental methods in identifying optimal drug combinations, computational approaches can provide a guide to limit the search space and reduce cost. However, few computational approaches have been developed for this purpose, and thus there is a great need of new algorithms for drug combination prediction.ResultsHere we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC). Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. MOTSC seeks a full coverage on the disease gene set while minimizing the off-target set. Through simulation, both BTSC and MOTSC demonstrated a much faster running time over exhaustive search with the same accuracy. When applied to real disease gene sets, our algorithms not only identified known drug combinations, but also predicted novel drug combinations that are worth further testing. In addition, we developed a web-based tool to allow users to iteratively search for optimal drug combinations given a user-defined gene set.AvailabilityOur tool is freely available for noncommercial use at http://www.drug.liuzlab.org/.Contactzhandong.liu@bcm.eduSupplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC4016706 | biostudies-literature
Project description:A gene is considered as essential when it is indispensable for cells to grow and replicate in a certain environment. However, gene essentiality is not a structural property but rather a contextual one, which depends on the specific biological conditions affecting the cell. This circumstantial essentiality of genes is what brings the attention of scientist since we can identify genes essential for cancer cells but not essential for healthy cells. This same contextuality makes their identification extremely challenging. Huge experimental efforts such as Project Achilles where the essentiality of thousands of genes is measured together with a plethora of molecular data (transcriptomics, copy number, mutations, etc.) in over one thousand cell lines can shed light on the causality behind the essentiality of a gene in a given environment. Here, we present an in-silico method for the identification of patient-specific essential genes using constraint-based modelling (CBM). Our method expands the ideas behind traditional CBM to accommodate multisystem networks. In essence, it first calculates the minimum number of lowly expressed genes required to be activated by the cell to sustain life as defined by a set of requirements; and second, it performs an exhaustive in-silico gene knockout to find those that lead to the need of activating additional lowly expressed genes. We validated the proposed methodology using a set of 452 cancer cell lines derived from the Cancer Cell Line Encyclopedia where an exhaustive experimental large-scale gene knockout study using CRISPR (Achilles Project) evaluates the impact of each removal. We also show that the integration of different essentiality predictions per gene, what we called Essentiality Congruity Score, reduces the number of false positives. Finally, we explored our method in a breast cancer patient dataset, and our results showed high concordance with previous publications. These findings suggest that identifying genes whose activity is fundamental to sustain cellular life in a patient-specific manner is feasible using in-silico methods. The patient-level gene essentiality predictions can pave the way for precision medicine by identifying potential drug targets whose deletion can induce death in tumour cells.
| S-EPMC9357337 | biostudies-literature
Project description:Automatically generating a summary for asynchronous data can help users to keep up with the rapid growth of multi-modal information on the Internet. However, the current multi-modal systems usually generate summaries composed of text and images. In this paper, we propose a novel research problem of text-image-video summary generation (TIVS). We first develop a multi-modal dataset containing text documents, images and videos. We then propose a novel joint integer linear programming multi-modal summarization (JILP-MMS) framework. We report the performance of our model on the developed dataset.
| S-EPMC7148046 | biostudies-literature
Project description:Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.Depending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator-prey interactions between the species in a community to define viability constraints.Despite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.We exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.
| S-EPMC4392707 | biostudies-literature
Project description:The increase in data amount makes the traditional Internet of Vehicles (IoV) fail to meet users' needs. Hence, the IoV is explored in series. To study the construction of freight integer linear programming (ILP) model based on fog computing (FG), and to analyze the application of the model in the optimization of the networking deployment (ND) of the IoV. FG and ILP are combined to build a freight computing ILP model. The model is used to analyze the application of ND optimization in the IoV system through simulations. The results show that while analyzing the ND results in different scenarios, the model is more suitable for small-scale scenarios and can optimize the objective function; however, its utilization rate is low in large-scale scenarios. While comparing and analyzing the network cost and running time, compared with traditional cloud computing solutions, the ND solution based on FG requires less cost, shorter running time, and has apparent effectiveness and efficiency. Therefore, it is found that the FG-based model has low cost, short running time, and apparent efficiency, which provides an experimental basis for the application of the later deployment of freight vehicles (FVs) in the Internet of Things (IoT) system for ND optimization. The results will provide important theoretical support for the overall deployment of IoV.
| S-EPMC7514103 | biostudies-literature
Project description:MotivationConsiderable attention has been focused on predicting RNA-RNA interaction since it is a key to identifying possible targets of non-coding small RNAs that regulate gene expression post-transcriptionally. A number of computational studies have so far been devoted to predicting joint secondary structures or binding sites under a specific class of interactions. In general, there is a trade-off between range of interaction type and efficiency of a prediction algorithm, and thus efficient computational methods for predicting comprehensive type of interaction are still awaited.ResultsWe present RactIP, a fast and accurate prediction method for RNA-RNA interaction of general type using integer programming. RactIP can integrate approximate information on an ensemble of equilibrium joint structures into the objective function of integer programming using posterior internal and external base-paring probabilities. Experimental results on real interaction data show that prediction accuracy of RactIP is at least comparable to that of several state-of-the-art methods for RNA-RNA interaction prediction. Moreover, we demonstrate that RactIP can run incomparably faster than competitive methods for predicting joint secondary structures.AvailabilityRactIP is implemented in C++, and the source code is available at http://www.ncrna.org/software/ractip/.
| S-EPMC2935440 | biostudies-literature
Project description:Direct projection of 3D branching structures, such as networks of cables, blood vessels, or neurons onto a 2D image creates the illusion of intersecting structural parts and creates challenges for understanding and communication. We present a method for visualizing such structures, and demonstrate its utility in visualizing the abdominal aorta and its branches, whose tomographic images might be obtained by computed tomography or magnetic resonance angiography, in a single 2D stylistic image, without overlaps among branches. The visualization method, termed uncluttered single-image visualization (USIV), involves optimization of geometry. This paper proposes a novel optimization technique that utilizes an interesting connection of the optimization problem regarding USIV to the protein structure prediction problem. Adopting the integer linear programming-based formulation for the protein structure prediction problem, we tested the proposed technique using 30 visualizations produced from five patient scans with representative anatomical variants in the abdominal aortic vessel tree. The novel technique can exploit commodity-level parallelism, enabling use of general-purpose graphics processing unit (GPGPU) technology that yields a significant speedup. Comparison of the results with the other optimization technique previously reported elsewhere suggests that, in most aspects, the quality of the visualization is comparable to that of the previous one, with a significant gain in the computation time of the algorithm.
| S-EPMC3758916 | biostudies-literature