Homogeneously non-idling schedules of unit-time jobs on identical parallel machines

DOI10.1016/J.DAM.2013.01.019MaRDI QIDQ2446341zbMATH OpenOpenAlexFDO

Authors Philippe Chrétienne, Alain Quilliot

Publication date 16 April 2014

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

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

zbMATH Keywords

feasibility criteriamatchingnon-idling machinescheduling unit-time tasks on \(m\) parallel machines

Mathematics Subject Classification ID

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

Recommendations

• A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines
• On scheduling with the non-idling constraint
• On scheduling with the non-idling constraint
• No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
• On single-machine scheduling without intermediate delays

Cites work

• An exact approach to early/tardy scheduling with release dates
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
• Complexity of Scheduling under Precedence Constraints
• On single-machine scheduling without intermediate delays
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
• Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems

Cited in

(5)

• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
• A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent 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: Homogeneously non-idling schedules of unit-time jobs on identical parallel machines

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