Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
type: Item
instance of: scholarly article
title: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
zbMATH Open document ID: 1353.90063
author: Imed Kacem
author: Hans Kellerer
author: Maryam Seifaddini
published in: Journal of Combinatorial Optimization
publication date: 2016-10-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6637646
zbMATH Keywords: approximation schemes
zbMATH Keywords: scheduling
zbMATH Keywords: maximum lateness
zbMATH Keywords: single machine
zbMATH Keywords: fixed operator interval
zbMATH Keywords: machine non-availability interval
MaRDI profile type: Publication
full work available at URL: s10878-015-9924-4
OpenAlex ID: W2212575943
cites work: Operator non-availability periods
cites work: The one-machine sequencing problem
cites work: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: Improved algorithms for two single machine scheduling problems
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: Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
cites work: Planning Machine Maintenance in Two-Machine Shop Scheduling
cites work: Machine scheduling with an availability constraint
cites work: A note on worst-case performance of heuristics for maintenance scheduling problems
cites work: Scheduling the maintenance on a single machine
cites work: Single machine scheduling with small operator-non-availability periods
cites work: Algorithms for Scheduling Independent Tasks
cites work: Scheduling with limited machine availability
cites work: SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
DOI: 10.1007/S10878-015-9924-4
description: scientific article; zbMATH DE number 6637646