Results 61 to 70 of about 137,584 (378)

Targeted protein degradation in oncology: novel therapeutic opportunity for solid tumours?

open access: yesMolecular Oncology, EarlyView.
Current anticancer therapies are limited by the occurrence of resistance and undruggability of most proteins. Targeted protein degraders are novel, promising agents that trigger the selective degradation of previously undruggable proteins through the recruitment of the ubiquitin–proteasome machinery. Their mechanism of action raises exciting challenges,
Noé Herbel, Sophie Postel‐Vinay
wiley   +1 more source

Analysis of usage of genetic and tabu search algorithms in shop scheduling

open access: yesLietuvos 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

Developing Multistage Heuristic Algorithm To Minimize Idle Time And Makespan In Job Shop Scheduling [PDF]

open access: yesEngineering and Technology Journal, 2010
The behavior and performance of job shops have been the focus andattention in both operations research and operations management literature. Job shop scheduling has received this large amount of attention, because it has the potential to dramatically ...
Mahmoud Abbas Mahmoud
doaj   +1 more source

Intelligent Scheduling with Reinforcement Learning

open access: yesApplied Sciences, 2021
In this paper, we present and discuss an innovative approach to solve Job Shop scheduling problems based on machine learning techniques. Traditionally, when choosing how to solve Job Shop scheduling problems, there are two main options: either use an ...
Bruno Cunha   +3 more
doaj   +1 more source

Job Shop Scheduling by Simulated Annealing [PDF]

open access: yesOperations Research, 1992
We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems.
Jan Karel Lenstra   +2 more
openaire   +2 more sources

A branch and bound and simulated annealing approach for job shop scheduling [PDF]

open access: yes, 2004
This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In
Salim, Sutinah, Tan, Hui Woon
core  

An approach for coherent periodogram averaging of tilt‐series data for improved contrast transfer function estimation

open access: yesFEBS Open Bio, EarlyView.
The contrast transfer function (CTF) is an imaging aberration that is a major resolution‐limiting factor in cryo‐electron microscopy (cryo‐EM). Precise CTF estimation is key to overcoming this limitation, but is particularly challenging in cryo‐electron tomography (cryo‐ET) data. Here, we present an approach for using geometric information to assist in
Sagar Khavnekar, William Wan
wiley   +1 more source

Hybrid job shop scheduling [PDF]

open access: yes, 1995
We consider the problem of scheduling jobs in a hybrid job shop. We use the term\ud 'hybrid' to indicate that we consider a lot of extensions of the classic job shop, such as transportation times, multiple resources, and setup times.
Schutten, J.M.J.
core   +6 more sources

Highly Efficient Encoding for Job-Shop Scheduling Problems and its Application on Quantum Computers [PDF]

open access: yesQuantum Sci. Technol. 10 015051 (2025)
Combinatorial optimization problems are considered to be an application, where quantum computing can have transformative impact. In the industrial context, job shop scheduling problems that aim at finding the optimal schedule for a set of jobs to be run on a set of machines are of immense interest.
arxiv   +1 more source

Large-Scale Benchmarks for the Job Shop Scheduling Problem [PDF]

open access: yesarXiv, 2021
This report contains the description of two novel job shop scheduling benchmarks that resemble instances of real scheduling problem as they appear in industry. In particular, the aim was to provide large-scale benchmarks (up to 1 million operations) to test the state-of-the-art scheduling solutions on problems that are closer to what occurs in a real ...
arxiv  

Home - About - Disclaimer - Privacy