A note on scheduling parallel machines subject to breakdown and repair

DOI10.1002/NAV.10105zbMath1055.90035OpenAlexW2041774822MaRDI QIDQ4651709

Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 22 February 2005

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10105

zbMATH Keywords

makespantotal completion timemaximum latenesspreemptionSPT rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Total completion time minimization on multiple machines subject to machine availability and makespan constraints ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints

This page was built for publication: A note on scheduling parallel machines subject to breakdown and repair