Results 71 to 80 of about 1,132,012 (246)
A Predictive-reactive Approach for JSP with Uncertain Processing Times [PDF]
, 2010 The paper is supported by the Asia-Link project funded by the European Commission (CN/ASIA-LINK/024 (109093)), the National Natural Science Foundation of China (50705076, 50705077), and the National Hi-Tech R&D Program of China (2007AA04Z187)JSP with ...
NIU, Ganggang +3 more
core
Molecular Oncology, EarlyView.In head and neck squamous cell carcinoma (HNSCC) p53 and p63 exert opposite roles on the transcription regulation of the lncRNA NEAT1. Under basal conditions, p53 levels are low and p63 represses NEAT1 expression. Upon genotoxic stress, p53 is rapidly induced, displacing p63 from the NEAT1 promoter leading to NEAT1 transcriptional activation and ...
Sara De Domenico +5 more
wiley +1 more source
Better approximation guarantees for job-shop scheduling [PDF]
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee.
Paterson, Michael S. +3 more
core
Um modelo para o planejamento e a programação da produção em ambientes job shop baseado em redes de Petri [PDF]
, 2001 Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de ProduçãoUm dos maiores desafios enfrentados pela administração da produção e do qual depende muito a eficiência de todo sistema ...
Chile Palomino, Reynaldo
core
Molecular Oncology, EarlyView.This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault +12 more
wiley +1 more source
PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA
Jurnal Masyarakat Informatika, 2010 Job Shop Scheduling Problem (JSP) is a problem of work scheduling that can be describe by one or several job that have to be done by one or several source, each job contain of several operation that has to be done without interuption in several time and ...
Satriyo Adhy, Kushartantya Kushartantya
doaj +1 more source
Molecular Oncology, EarlyView.Circulating microRNA profiles distinguish nonmalignant Lynch syndrome from cancer‐associated Lynch syndrome, sporadic colorectal cancer, and healthy controls. Age‐stratified analysis reveals disease‐specific regulatory states, and a six‐miRNA panel shows concordant separation in an independent colorectal tissue cohort.
Ramadhani Salum Chambuso +5 more
wiley +1 more source
, 2022 De JOB-monitor is in 2001 door Jongeren Organisatie Beroepsonderwijs (JOB) opgezet om de tevredenheid van mbo-studenten te meten. Elke twee jaar laat JOB de monitor uitvoeren door onderzoeksbureau ResearchNed.
ResearchNed
core +1 more source
Molecular Oncology, EarlyView.The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim +17 more
wiley +1 more source
Analysis of usage of genetic and tabu search algorithms in shop scheduling
Lietuvos Matematikos Rinkinys, 2008 A wide area of scheduling problem is industrial so-called shop scheduling (Job Shop, Flow Shop and Open Shop) which has important applications in real world industrial problems.
Edgaras Šakurovas +1 more
doaj +1 more source