Single-machine scheduling with periodic maintenance and nonresumable jobs.
type: Item
instance of: scholarly article
title: Single-machine scheduling with periodic maintenance and nonresumable jobs.
zbMATH Open document ID: 1037.90031
DOI: 10.1016/S0305-0548(02)00074-6
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1901873
zbMATH Keywords: Scheduling
zbMATH Keywords: Periodic maintenance
zbMATH Keywords: Maximum tardiness
zbMATH Keywords: Nonresumable job
MaRDI profile type: Publication
cites work: Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
cites work: Minimizing the sum of job completion times on capacitated parallel machines
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Machine scheduling with an availability constraint
cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
cites work: Two-machine flowshop scheduling with availability constraints
cites work: Q3911421
description: scientific article; zbMATH DE number 1901873