Single machine scheduling subject to deadlines and resource dependent processing times
type: Item
instance of: scholarly article
title: Single machine scheduling subject to deadlines and resource dependent processing times
zbMATH Open document ID: 0947.90584
DOI: 10.1016/0377-2217(96)00129-4
author: Adam Janiak
author: M. Y. Kovalyov
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1252896
zbMATH Keywords: scheduling theory
zbMATH Keywords: resource allocation
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: 0377-2217(96)00129-4
OpenAlex ID: W2020006381
cites work: Q4873242
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Single machine scheduling problem with a common deadline and resource dependent release dates
cites work: Q3050157
cites work: Improving the complexities of approximation algorithms for optimization problems
cites work: Q3123417
cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
description: scientific article; zbMATH DE number 1252896