Results 181 to 190 of about 6,771,333 (197)
Some of the next articles are maybe not open access.
Probability in the Engineering and Informational Sciences, 1991
This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.
openaire +2 more sources
This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.
openaire +2 more sources
Optimization Methods and Software, 2013
The preemptive single machine scheduling problem of minimizing the total weighted completion time with arbitrary processing times and release dates is an important NP-hard problem in scheduling theory. In this paper we present an efficient high-quality heuristic for this problem based on the Weighted Shortest Remaining Processing Time (WSRPT) rule. The
Mikhail Batsyn +3 more
openaire +1 more source
The preemptive single machine scheduling problem of minimizing the total weighted completion time with arbitrary processing times and release dates is an important NP-hard problem in scheduling theory. In this paper we present an efficient high-quality heuristic for this problem based on the Weighted Shortest Remaining Processing Time (WSRPT) rule. The
Mikhail Batsyn +3 more
openaire +1 more source
European Journal of Operational Research, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana, S. P., Singh, N.
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana, S. P., Singh, N.
exaly +3 more sources
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Operations Research Letters, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A single machine preemptive scheduling problem with arbitrary release dates and fuzzy due dates
2009 ISECS International Colloquium on Computing, Communication, Control, and Management, 2009Preemptive scheduling problem of a single machine subject to arbitrary release dates under uncertain situation is discussed. The release dates of jobs are independence and different with each other. Uncertainty means due dates are not accurate, which can be described by fuzzy set.
Xie Yuan, LinLin Ou
openaire +1 more source
Operations Research Letters, 2009
We give a direct combinatorial O(n^3logn) algorithm for minimizing the number of late jobs on a single machine when jobs have release times and preemptions are allowed. Our algorithm improves the earlier O(n^5) and O(n^4) dynamic programming algorithms for this problem.
openaire +2 more sources
We give a direct combinatorial O(n^3logn) algorithm for minimizing the number of late jobs on a single machine when jobs have release times and preemptions are allowed. Our algorithm improves the earlier O(n^5) and O(n^4) dynamic programming algorithms for this problem.
openaire +2 more sources
A column generation approach to a class of single-machine preemptive scheduling problems.
2002Convegno AIRO ...
A. AGNETIS, ALFIERI, Arianna, G. NICOSIA
openaire +2 more sources
2013
The preemptive single machine scheduling problem of minimizing the total weighted completion time with equal processing times and arbitrary release dates is one of the four single machine scheduling problems with an open computational complexity status.
Mikhail Batsyn +3 more
openaire +1 more source
The preemptive single machine scheduling problem of minimizing the total weighted completion time with equal processing times and arbitrary release dates is one of the four single machine scheduling problems with an open computational complexity status.
Mikhail Batsyn +3 more
openaire +1 more source
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs
Computers and Industrial Engineering, 2022Jinjiang Yuan, Rubing Chen
exaly