On single-machine scheduling without intermediate delays

DOI10.1016/J.DAM.2008.03.010MaRDI QIDQ955319zbMATH OpenOpenAlexFDO

Authors Philippe Chrétienne

Publication date 19 November 2008

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

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

zbMATH Keywords

algorithmcomplexityscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On scheduling with the non-idling constraint
• On scheduling with the non-idling constraint
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
• An exact block algorithm for no-idle RPQ problem

Cites work

• An exact approach to early/tardy scheduling with release dates
• Complexity results for scheduling chains on a single machine
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Scheduling equal-length jobs on identical parallel machines
• The one-machine sequencing problem

Cited in

(15)

• An exact block algorithm for no-idle RPQ problem
• Delay-bounded scheduling without delay!
• A multivariate complexity analysis of the material consumption scheduling problem
• Scheduling a single machine with primary and secondary objectives
• A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines
• Scheduling chains on a single machine with non-negative time lags
• Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
• Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
• Tactically delayed versus non-delay scheduling: An experimental investigation
• A greedy approximation algorithm for minimum-gap scheduling
• On scheduling with the non-idling constraint
• On scheduling with the non-idling constraint

This page was built for publication: On single-machine scheduling without intermediate delays

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