Results 141 to 150 of about 7,634,020 (164)
Some of the next articles are maybe not open access.
Automation and Remote Control, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lazarev, A. A., Kvaratskhelia, A. G.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lazarev, A. A., Kvaratskhelia, A. G.
openaire +3 more sources
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Computers & Operations Research, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Artem Fomin, Boris Goldengorin
openaire +2 more sources
Jackson's semi-preemptive scheduling on a single machine
We propose an effective improvement of the well-known Jackson's preemptive schedule lower bound for the single machine scheduling problem with heads and tails.
Anis Gharbi, Mohamed Labidi
exaly +1 more source
Scheduling single machine with random breakdown and preemptive jobs
Journal of Industrial and Production Engineering, 2017AbstractThis 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 ...
Hassan Haleh +3 more
openaire +1 more source
Single-machine scheduling with preemptive jobs and workload-dependent maintenance durations
Operational Research, 2015A single-machine scheduling problem with preemptive jobs and workload-dependent maintenance durations is considered. The length of a maintenance duration is modeled as an non-negative increasing function of the total processing time of the jobs scheduled between the current maintenance and the latest previous one.
Zhijun Xu, Dehua Xu
openaire +1 more source
Information Processing Letters, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinjiang Yuan, Yixun Lin
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.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana, S. P., Singh, N.
openaire +2 more sources
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
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

