Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
type: Item
instance of: scholarly article
title: Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
zbMATH Open document ID: 1054.90041
published in: Operations Research Letters
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2125889
zbMATH Keywords: Energetic reasoning
zbMATH Keywords: Preemptive relaxation
zbMATH Keywords: Identical parallel machines
author: Fabrice Tercinet
author: Ch. Lenté
author: E. Néron
MaRDI profile type: Publication
full work available at URL: j.orl.2003.08.008
OpenAlex ID: W2018735909
cites work: Q3056948
cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems
cites work: Q4859840
cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
cites work: Minimizing makespan on parallel machines subject to release dates and delivery times
cites work: An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
cites work: Some simple scheduling algorithms
DOI: 10.1016/J.ORL.2003.08.008
description: scientific article; zbMATH DE number 2125889