On single-machine scheduling without intermediate delays
type: Item
instance of: scholarly article
title: On single-machine scheduling without intermediate delays
zbMATH Open document ID: 1152.90436
author: Philippe Chrétienne
published in: Discrete Applied Mathematics
publication date: 2008-11-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5369025
zbMATH Keywords: scheduling
zbMATH Keywords: complexity
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2008.03.010
OpenAlex ID: W2011999391
cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
cites work: Scheduling equal-length jobs on identical parallel machines
cites work: The one-machine sequencing problem
cites work: Complexity results for scheduling chains on a single machine
cites work: An exact approach to early/tardy scheduling with release dates
DOI: 10.1016/J.DAM.2008.03.010
description: scientific article; zbMATH DE number 5369025