scientific article; zbMATH DE number 5669900

MaRDI QIDQ3402864zbMATH OpenFDO

Authors Lan Zuo

Publication date 12 February 2010

zbMATH Keywords

schedulinguniform machinechain-like precedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• A comment on scheduling on uniform machines under chain-type precedence constraints
• Scheduling identical jobs with chain precedence constraints on two uniform machines
• Uniform machine scheduling of unit-time jobs subject to resource constraints
• Scheduling of uniform parallel machines with s-precedence constraints
• Approximation schemes for scheduling jobs with chain precedence constraints
• Scheduling unit-length jobs with precedence constraints of small height
• scientific article; zbMATH DE number 4023000
• Parallel Processing and Applied Mathematics
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Scheduling unit-length jobs with machine eligibility restrictions

Cited in

(2)

• scientific article; zbMATH DE number 2044495 (Why is no real title available?)
• Scheduling unit-length jobs with machine eligibility restrictions

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 Q3402864)