High-multiplicity scheduling on one machine with forbidden start and completion times
type: Item
instance of: scholarly article
title: High-multiplicity scheduling on one machine with forbidden start and completion times
zbMATH Open document ID: 1353.90059
author: Michaël Gabay
author: Christophe Rapine
author: Nadia Brauner
published in: Journal of Scheduling
publication date: 2016-11-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6653507
zbMATH Keywords: scheduling
zbMATH Keywords: high-multiplicity
zbMATH Keywords: availability constraints
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
full work available at URL: s10951-016-0475-z
OpenAlex ID: W2331986476
cites work: Single machine scheduling with forbidden start times
cites work: A framework for the complexity of high-multiplicity scheduling problems
cites work: Operator non-availability periods
cites work: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
cites work: Parallel machine scheduling with high multiplicity
cites work: Algorithms - ESA 2003
cites work: An asymptotically exact algorithm for the high-multiplicity bin packing problem
cites work: Exact and approximate algorithms for high-multiplicity parallel machine scheduling
cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
cites work: Integer Programming with a Fixed Number of Variables
cites work: A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
cites work: Single machine scheduling with small operator-non-availability periods
DOI: 10.1007/S10951-016-0475-Z
description: scientific article; zbMATH DE number 6653507