A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
type: Item
instance of: scholarly article
title: A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
zbMATH Open document ID: 1506.90113
author: Christophe Rapine
author: Nadia Brauner
published in: Discrete Optimization
publication date: 2018-10-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6958399
zbMATH Keywords: scheduling
zbMATH Keywords: makespan criterion
zbMATH Keywords: availability constraints
MaRDI profile type: Publication
full work available at URL: j.disopt.2013.07.003
OpenAlex ID: W1977635807
cites work: Q4821818
cites work: Operator non-availability periods
cites work: Single machine scheduling with small operator-non-availability periods
cites work: One-operator-two-machine flowshop scheduling with setup and dismounting times
cites work: Parallel machine scheduling with a common server
cites work: Scheduling two parallel machines with a single server: the general case
cites work: Parallel machine scheduling with multiple unloading servers
cites work: Scheduling two parallel semiautomatic machines to minimize machine interference
cites work: Parallel machine scheduling problems with a single server
cites work: Single machine scheduling with forbidden start times
cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
cites work: A framework for the complexity of high-multiplicity scheduling problems
DOI: 10.1016/J.DISOPT.2013.07.003
description: scientific article; zbMATH DE number 6958399