A study of single-machine scheduling problem to maximize throughput
type: Item
instance of: scholarly article
title: A study of single-machine scheduling problem to maximize throughput
zbMATH Open document ID: 1297.90059
author: Nodari Vakhania
published in: Journal of Scheduling
publication date: 2014-08-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6331173
zbMATH Keywords: scheduling
zbMATH Keywords: single-machine
zbMATH Keywords: release time
zbMATH Keywords: due-date
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: s10951-012-0307-8
OpenAlex ID: W2079322303
cites work: Complexity results for single-machine problems with positive finish-start time-lags
cites work: A note on scheduling equal-length jobs to maximize throughput
cites work: Q4198056
cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
cites work: Parallel machine problems with equal processing times: a survey
cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: A better algorithm for sequencing with release and delivery times on identical machines
cites work: Branch less, cut more and minimize the number of late equal-length jobs on identical machines
DOI: 10.1007/S10951-012-0307-8
description: scientific article; zbMATH DE number 6331173