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.011MaRDI QIDQ1752453zbMATH OpenOpenAlexWikidataFDO

Authors Philippe Chrétienne, Alain Quilliot

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)

Recommendations

• Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
• On scheduling with the non-idling constraint
• On scheduling with the non-idling constraint
• scientific article; zbMATH DE number 4164535
• No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines

Cites work

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

Cited in

(4)

• Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
• 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
• On scheduling with the non-idling constraint

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

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