Results 161 to 170 of about 6,771,333 (197)

Minimizing total weighted tardiness and overtime costs for single machine preemptive scheduling

Computers and Industrial Engineering, 2017
We study the single machine preemptive scheduling problem with both regular and overtime modes.The objective is to minimize the total tardiness and overtime costs.We propose a heuristic solution methodology for the problem.The efficiency of the heuristic is tested with upper bounds generated by the mathematical model.
Murat Erkoç
exaly   +3 more sources

Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness

Operations Research Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C T Ng
exaly   +2 more sources

Modeling single machine preemptive scheduling problems for computational efficiency

Annals of Operations Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernando Jaramillo, Busra Keles, Murat Erkoc   +2 more
openaire   +3 more sources

Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria

European Journal of Operational Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinjiang Yuan, Yixun Lin
exaly   +2 more sources

An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times [PDF]

Asia-Pacific Journal of Operational Research, 2014
We study a preemptive scheduling problem on two identical parallel machines that share a common server. Each job has to be loaded by the server before being processed on one of the machines and unloaded by the server after its processing. The loading and unloading times are both equal to one time unit. The goal is to minimize the makespan.
Yiwei Jiang, Huijuan Wang, Ping Zhou
openaire   +2 more sources

Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness

Computers & Industrial Engineering, 2021
Abstract In this paper, we refine the ties within decision rules of the Total Weighted Tardiness (TWT) heuristic from Jaramillo and Erkoc (2017) applied by the authors to solving the preemptive single machine scheduling problem with arbitrary release and due dates, priority factors (weights), and equal processing times of a finite number of jobs. The
Boris Goldengorin, Vadim V. Romanuke
openaire   +2 more sources

Competitive analysis of preemptive single-machine scheduling

Operations Research Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem

Discrete Optimization
Ankit Bansal
exaly   +3 more sources

Single-machine scheduling with preemptive jobs and workload-dependent maintenance durations

Operational Research, 2015
A 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

Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints

Operations Research, 1983
Suppose n jobs are to be processed on a single machine, subject to release dates and precedence constraints. The problem is to find a preemptive schedule which minimizes the maximum job completion cost. We present an O(n2) algorithm for this problem, generalizing previous results of E. L. Lawler.
J K Lenstra, A H G Rinnooy Kan, E L Lawler   +2 more
exaly   +2 more sources