scientific article; zbMATH DE number 7235437

DOI10.15960/J.CNKI.ISSN.1007-6093.2019.04.008MaRDI QIDQ5115408zbMATH OpenFDO

Authors Ganggang Li, Xiwen Lu

Publication date 12 August 2020

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2019.04.008

zbMATH Keywords

delivery timemaintenancesingle-machine schedulingworst-case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation algorithms for the single-machine scheduling with a period of maintenance
• Single-machine scheduling with periodic maintenance to minimize makespan revisited
• Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
• Single-machine scheduling with periodic maintenance to minimize makespan
• An improved approximation algorithm for single machine scheduling with job delivery
• Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness
• Single-machine scheduling with fixed periodic preventive maintenance to minimise the total weighted completion times
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities

Cited in

(3)

• A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
• Approximation algorithms for the single-machine scheduling with a period of maintenance
• Algorithmic Applications in Management

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115408)