Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
type: Item
instance of: scholarly article
title: Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
zbMATH Open document ID: 1185.90084
author: Chinyao Low
author: Min Ji
author: Chou-Jung Hsu
author: Chwen-Tzeng Su
published in: Applied Mathematical Modelling
publication date: 2010-05-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5703192
zbMATH Keywords: single machine scheduling
zbMATH Keywords: periodic maintenance
zbMATH Keywords: flexible maintenance
zbMATH Keywords: NP-hard
zbMATH Keywords: heuristic algorithm
MaRDI profile type: Publication
full work available at URL: j.apm.2009.04.014
OpenAlex ID: W2026949381
cites work: Q3525911
cites work: Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
cites work: Single machine flow-time scheduling with scheduled maintenance
cites work: Machine scheduling with availability constraints
cites work: Scheduling with limited machine availability
cites work: Single-machine scheduling with periodic maintenance and nonresumable jobs.
cites work: Single-machine scheduling with periodic maintenance to minimize makespan
cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
cites work: Scheduling linear deteriorating jobs with an availability constraint on a single machine
cites work: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
cites work: Single machine scheduling with a restricted rate-modifying activity
cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times
cites work: Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
cites work: Single-machine scheduling with flexible and periodic maintenance
cites work: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
cites work: Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
cites work: A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan''
cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
DOI: 10.1016/J.APM.2009.04.014
description: scientific article; zbMATH DE number 5703192