Branch less, cut more and minimize the number of late equal-length jobs on identical machines
type: Item
instance of: scholarly article
title: Branch less, cut more and minimize the number of late equal-length jobs on identical machines
zbMATH Open document ID: 1259.90038
author: Nodari Vakhania
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6122475
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: solution tree
zbMATH Keywords: scheduling identical machines
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.08.031
OpenAlex ID: W2077843589
cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
cites work: A note on scheduling equal-length jobs to maximize throughput
cites work: On the complexity of minimizing the number of late jobs in unit time open shop
cites work: Q4016820
cites work: Q3206647
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: Single-machine scheduling with release times and tails
cites work: Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
DOI: 10.1016/J.TCS.2012.08.031
description: scientific article; zbMATH DE number 6122475