Maintenance scheduling problems as benchmarks for constraint algorithms
type: Item
instance of: scholarly article
title: Maintenance scheduling problems as benchmarks for constraint algorithms
zbMATH Open document ID: 0940.68037
DOI: 10.1023/A:1018906911996
author: Daniel Frost
author: Rina Dechter
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2000-06-07T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1456920
zbMATH Keywords: search algorithm
zbMATH Keywords: scheduling
MaRDI profile type: Publication
full work available at URL: a:1018906911996
OpenAlex ID: W1707765878
Recommended article: The maintenance conversion scheduling problem: Models and insights
Recommended article: A note on worst-case performance of heuristics for maintenance scheduling problems
Recommended article: Parallel-machine scheduling with maintenance: praising the assignment problem
Recommended article: Approximation Algorithms for Scheduling with a Variable Machine Maintenance
Recommended article: Approximation algorithms for the single-machine scheduling with a period of maintenance
Recommended article: A column generation model for a scheduling problem with maintenance constraints
Recommended article: A GRASP algorithm for flexible job-shop scheduling with maintenance constraints
Recommended article: On the on-line maintenance scheduling problem
Recommended article: Special issue on maintenance scheduling: theory and applications
Recommended article: Scheduling algorithm for maintenance tasks under uncertainty
description: scientific article; zbMATH DE number 1456920