Results 1 to 10 of about 7,608,228 (197)

Sensitivity Analysis for the Single-Machine Preemptive Scheduling Problem of Minimizing Flow Time

IEEE Access, 2023
Sensitivity analysis for the single-machine preemptive scheduling problem of minimizing flow time is discussed herein. Note that an optimal solution of the scheduling problem contains not just a combinatorial structure but also a temporal structure.
Xiaoxi Li, Shanlin Li
doaj   +4 more sources

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.
Abhishek Singh
openaire   +3 more sources

ACCURACY OF A HEURISTIC FOR TOTAL WEIGHTED COMPLETION TIME MINIMIZATION IN PREEMPTIVE SINGLE MACHINE SCHEDULING PROBLEM BY NO IDLE TIME INTERVALS

KPI Science News, 2019
Background. A special case of the job scheduling process is that when jobs are processed on a single machine, preemptions are allowed, and there are no idle time intervals.
Vadim V. Romanuke
doaj   +2 more sources

Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling

Applied Computer Systems, 2019
Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied. The Boolean linear programming model, which allows obtaining the exactly minimal tardiness, becomes too time ...
Romanuke Vadim
doaj   +2 more sources

ACCURATE TOTAL WEIGHTED TARDINESS MINIMIZATION IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH PREEMPTIONS BY NO IDLE PERIODS

KPI Science News, 2019
Background. The problem of minimization of total weighted tardiness can be solved either exactly by the corresponding models or heuristically. As of October 2019, nearly the best heuristic is one based on using remaining available and processing periods.
Vadim V. Romanuke
doaj   +2 more sources

Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals [PDF]

RAIRO - Operations Research, 2001
Summary: This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the ...
Valery S. Gordon, Frank Werner 0001, O. A. Yanushkevich   +2 more
openaire   +4 more sources

TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING WITH JOB PRIORITY WEIGHTS BY HEURISTIC’S EFFICIENT JOB ORDER INPUT

KPI Science News, 2021
Background. In setting a problem of minimizing total weighted tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or ...
Vadim V. Romanuke
doaj   +1 more source

TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING BY HEURISTIC’S EFFICIENT JOB ORDER INPUT

KPI Science News, 2020
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending order ...
Vadim V. Romanuke
doaj   +1 more source

An efficient model for the preemptive single machine scheduling of equal-length jobs

CoRR, 2020
We propose a Boolean Linear Programming model for the preemptive single machine scheduling problem with equal processing times, arbitrary release dates and weights(priorities) minimizing the total weighted completion time. Almost always an optimal solution of the Linear Programming relaxation is integral and can be straightforwardly converted into an ...
Artem Fomin, Boris Goldengorin
openaire   +3 more sources

EFFICIENT EXACT MINIMIZATION OF TOTAL TARDINESS IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH IDLING-FREE PREEMPTIONS OF EQUAL-LENGTH JOBS

KPI Science News, 2020
Background. A schedule ensuring the exactly minimal total tardiness can be found with the respective integer linear programming problem. An open question is whether the exact schedule computation time changes if the job release dates are input to the ...
Vadim V. Romanuke
doaj   +1 more source