Approximation algorithms for single machine scheduling with one unavailability period
type: Item
instance of: scholarly article
title: Approximation algorithms for single machine scheduling with one unavailability period
zbMATH Open document ID: 1162.90458
author: Imed Kacem
author: Mohamed Haouari
published in: 4OR
publication date: 2009-06-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5567077
MaRDI profile type: Publication
full work available at URL: s10288-008-0076-6
OpenAlex ID: W1999566861
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
cites work: Machine scheduling with an availability constraint
cites work: Q3993418
cites work: New single machine and job-shop scheduling problems with availability constraints
cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
cites work: Algorithms for Scheduling Independent Tasks
cites work: Scheduling with limited machine availability
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: A comment on scheduling two parallel machines with capacity constraints
DOI: 10.1007/S10288-008-0076-6
description: scientific article; zbMATH DE number 5567077