Results 171 to 180 of about 6,771,333 (197)

A time indexed formulation of non-preemptive single machine scheduling problems

Mathematical Programming, 1992
The authors develop a time-indexed formulation for the general, non- preemptive, single machine scheduling problem. The advantage of this formulation is that restrictions like dead lines and release dates can easily be included and different objective functions, like weighted completion times and weighted tardiness, can be used.
Jorge P. Sousa, Laurence A. Wolsey
openaire   +3 more sources

Single-Machine Preemptive Scheduling with Release Dates Involving the Total Weighted Late Work Criterion

Journal of the Operations Research Society of China, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhi-Chao Geng, Yuan Zhang
openaire   +1 more source

Single machine preemptive scheduling by hybridized meta-heuristic approach

2011 IEEE 3rd International Conference on Communication Software and Networks, 2011
This paper is investigated the bi-criteria scheduling problem of minimizing the sum of the earliness and tardiness penalties on a single machine while the preemption is allowed. The problem which is known to be NP-hard is compatible with the concepts of just-in-Time (JIT) production.
N. Javadian, H. Khorshidian, J. Rezaeian, K. Rahmani   +3 more
openaire   +1 more source

Preemptive Single Machine Scheduling: Theory and Algorithms

Boris Goldengorin
exaly   +2 more sources

Modeling Single Machine Preemptive Scheduling to Minimize the Cost of Tardiness and Overtime

SSRN Electronic Journal, 2018
We propose two alternative mathematical modeling approaches for the problem of finding a preemptive schedule that minimizes the total cost of tardiness for a set of jobs on a single processor under variable workload requirements. The first model follows from the conventional scheduling approach and the second borrows from the aggregate planning ...
Fernando Jaramillo, Murat Erkoc
openaire   +1 more source

On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times

Information Processing Letters, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead

Asia-Pacific Journal of Operational Research, 2015
This paper studies the online preemptive scheduling of equal-length intervals on a single machine with lookahead. Let [Formula: see text] be the length (processing time) of all intervals. In the problem, at every time point [Formula: see text], online algorithms can foresee all the intervals that will arrive in the time segment [Formula: see text] for
Wenjie Li, Jinjiang Yuan
openaire   +2 more sources

single Machine Preemptive Scheduling With Special Cost Functions¹

Optimization, 1995
In this paper we consider a single machine scheduling problem, where for each of n jobs a release date, a processing time and a cost function are given and the maximum cost is to be minimized. Preemption is allowed and precedence constraints among the jobs are given. For this problem an O(n 2) algorithm is known from the literature.
E. Azharonok, V. Gordon, F. Werner
openaire   +1 more source

Preemptive Scheduling of a Single Machine with Finite States to Minimize Energy Costs

2017
This paper addresses a single machine scheduling problem in which the system may switch among three different states, namely ON (needed for processing the jobs), OFF or Idle. Each state, as well as switching among the different states, consume energy. The objective is schedule n preemptive jobs to minimize the total energy costs.
Aghelinejad, Mohammadmohsen, Ouazene, Yassine, Yalaoui, Alice   +2 more
openaire   +2 more sources

Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint

European Journal of Operational Research, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +2 more sources