Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
type: Item
instance of: scholarly article
title: Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
zbMATH Open document ID: 1391.90204
author: Wei-Wei Cui
author: Zhiqiang Lu
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6901354
zbMATH Keywords: scheduling
zbMATH Keywords: preventive maintenance
zbMATH Keywords: release date
zbMATH Keywords: makespan
MaRDI profile type: Publication
full work available at URL: j.cor.2016.11.008
OpenAlex ID: W2552618837
cites work: Machine scheduling with availability constraints
cites work: Scheduling with limited machine availability
cites work: Machine scheduling with an availability constraint
cites work: Single-machine scheduling with periodic maintenance to minimize makespan
cites work: Single machine flow-time scheduling with a single breakdown
cites work: Single machine flow-time scheduling with scheduled maintenance
cites work: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
cites work: Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
cites work: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
cites work: Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
cites work: Single-machine scheduling with periodic maintenance and nonresumable jobs.
cites work: Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
cites work: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
cites work: Q4934199
cites work: Scheduling a maintenance activity to minimize total weighted completion-time
cites work: Scheduling the maintenance on a single machine
cites work: Minimizing total completion time on a single machine with a flexible maintenance activity
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: Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
cites work: Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
cites work: A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
DOI: 10.1016/J.COR.2016.11.008
description: scientific article; zbMATH DE number 6901354