Single machine scheduling with forbidden start times
type: Item
instance of: scholarly article
title: Single machine scheduling with forbidden start times
zbMATH Open document ID: 1162.90444
author: J.-C. Billaut
author: Francis Sourd
published in: 4OR
publication date: 2009-06-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5567069
describes a project that uses: ILOG SCHEDULE
MaRDI profile type: Publication
full work available at URL: s10288-007-0061-5
OpenAlex ID: W1978278096
cites work: A framework for the complexity of high-multiplicity scheduling problems
cites work: Q4198056
cites work: Optimal parallel machines scheduling with availability constraints
cites work: On the complexity of scheduling tasks with discrete starting times
cites work: Machine scheduling with an availability constraint
cites work: Two-machine flowshop scheduling with availability constraints
cites work: New single machine and job-shop scheduling problems with availability constraints
cites work: Complexity results for scheduling tasks with discrete starting times
cites work: Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
DOI: 10.1007/S10288-007-0061-5
description: scientific article; zbMATH DE number 5567069