A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines

DOI10.1016/j.dam.2018.02.011zbMath1457.90066OpenAlexW2793045913MaRDI QIDQ1752453

Alain Quilliot, Philippe Chrétienne

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.011

zbMATH Keywords

algorithmic complexitydirected graphparallel-machine scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ On scheduling with the non-idling constraint

Cites Work

• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
• On single-machine scheduling without intermediate delays
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
• Homogeneously non-idling schedules of unit-time jobs on identical parallel machines

This page was built for publication: A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines