scientific article

zbMATH Open1183.90212MaRDI QIDQ3402864

Lan Zuo

Publication date: 12 February 2010

Title of this publication is not available (Why is that?)

zbMATH Keywords

schedulinguniform machinechain-like precedence constraints

Mathematics Subject Classification ID

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

Related Items (2)

Title not available (Why is that?) ⋮ Scheduling unit-length jobs with machine eligibility restrictions

Recommendations

• Title not available (Why is that?) 👍 👎
• Scheduling of uniform parallel machines with s-precedence constraints 👍 👎
• Uniform machine scheduling of unit-time jobs subject to resource constraints 👍 👎
• Scheduling unit-length jobs with precedence constraints of small height 👍 👎
• Scheduling identical jobs with chain precedence constraints on two uniform machines 👍 👎
• A comment on scheduling on uniform machines under chain-type precedence constraints 👍 👎
• Scheduling unit-length jobs with machine eligibility restrictions 👍 👎
• Scheduling unit length jobs with parallel nested machine processing set restrictions 👍 👎
• APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS 👍 👎
• Parallel Processing and Applied Mathematics 👍 👎

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)