Single processor scheduling with job values depending on their completion times
type: Item
instance of: scholarly article
title: Single processor scheduling with job values depending on their completion times
zbMATH Open document ID: 1154.90462
author: Adam Janiak
author: Tomasz Krysiak
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153391
zbMATH Keywords: Single processor
zbMATH Keywords: Job value
zbMATH Keywords: NP-hardness
zbMATH Keywords: Polynomial time
zbMATH Keywords: Heuristic
MaRDI profile type: Publication
full work available at URL: s10951-006-0004-6
OpenAlex ID: W1971744510
cites work: Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
cites work: Q4131987
cites work: Q3892056
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3048571
cites work: Q4099215
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Linear-Time Algorithms for Scheduling on Parallel Processors
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q3525910
cites work: Scheduling with batching: A review
cites work: Algorithms for Scheduling Independent Tasks
DOI: 10.1007/S10951-006-0004-6
description: scientific article; zbMATH DE number 5153391