scientific article; zbMATH DE number 1264427

MaRDI QIDQ4233363zbMATH OpenFDO

Authors Adam Janiak

Publication date 19 August 1999

zbMATH Keywords

job release datesmakespansingle machine schedulingtechnological precedence constraintstotal resource consumption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Single machine scheduling problems with resource dependent release times
• On scheduling a single machine with resource dependent release times
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single machine scheduling problem with a common deadline and resource dependent release dates

Cited in

(4)

• Job release scheduling problem: complexity and an approximation algorithm
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• Tight complexity analysis of the relocation problem with arbitrary release dates

This page was built for publication:

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