Results 151 to 160 of about 6,771,333 (197)

Development of a deep learning model for guiding treatment decisions of acute variceal bleeding in patients with cirrhosis. [PDF]

World J Gastroenterol
Xiang Y, Yang N, Zheng TL, Huang YF, Liu TY, Ma DQ, Hu SJ, Zhang WH, Xiang HL, Zhang LY, Yuan LL, Wang X, Dang T, Zhang G, Wu B, Peng LJ, Gao M, Xia DL, Liu ZB, Li J, Song Y, Zhou XQ, Qi XS, Zeng J, Tan XY, Deng MM, Fang HM, Qi SL, He S, He YF, Ye B, Wu W, Shao JB, Wei W, Hu JP, Yong X, He CH, Bao JL, Zhang YN, Ji R, Bo Y, Yan W, Li HJ, Li SL, Geng S, Zhao L, Liu B, Qi XL.   +47 more
europepmc   +1 more source

Jackson's semi-preemptive scheduling on a single machine

Computers and Operations Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anis Gharbi, Mohamed Labidi
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

The Single-Machine Preemptive or Resumable Scheduling with Maintenance Intervals

Journal of the Operations Research Society of China, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ru-Yan He, Jin-Jiang Yuan, Yuan Zhang
openaire   +2 more sources

Experimental analysis of tardiness in preemptive single machine scheduling

Expert Systems with Applications, 2021
Abstract This paper studies the scheduling of a finite set of jobs on a single machine. Jobs can be preempted. They are associated with respective release and due dates. In a more general case, each job has a priority weight. The objective is to minimize the total weighted tardiness.
Boris Goldengorin, Vadim V. Romanuke
openaire   +1 more source

An exact algorithm for the preemptive single machine scheduling of equal-length jobs

Computers & Operations Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Artem Fomin, Boris Goldengorin
openaire   +2 more sources

A 1.47-approximation algorithm for a preemptive single-machine scheduling problem

Operations Research Letters, 2000
In this note, we give a 1.47-approximation algorithm for the preemptive scheduling of jobs with release dates on a single machine so as to minimize the weighted sum of job completion times; this problem is denoted by 1|r"j,pmtn|@?"jw"jC"j in the notation of Lawler et al. (Handbooks in Operations Research and Management Science, Vol.
David P. Williamson, Michel Goemans
exaly   +3 more sources

Preemptive scheduling on two parallel machines with a single server

Computers and Industrial Engineering, 2013
This paper addresses a preemptive scheduling problem on two parallel machines with a single server. Each job has to be loaded (setup) by the server before being processed on the machines. The preemption is allowed in this paper. The goal is to minimize the makespan. We first show that it is no of use to preempt the job during its setup time.
Min Ji, Yiwei Jiang
exaly   +3 more sources

Scheduling single machine with random breakdown and preemptive jobs

Journal of Industrial and Production Engineering, 2017
AbstractThis study considers some significant parameters in the manufacturing systems, such as work in process, cut of works, number of earliness, and tardiness in just-in-time systems simultaneously. Discussing these assumptions could play a vital role in creating a competitive advantage as well as managing and improving the performance of the ...
Hojat Nabovati, Hamidreza Maghsoudlou
exaly   +2 more sources

Dynamic non-preemptive single machine scheduling

Computers & Operations Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sri V. Sridharan, Zhuoqun Zhou
openaire   +2 more sources

Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times

Acta Informatica, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asaf Levin, Tal Shusterman
openaire   +2 more sources