scientific article; zbMATH DE number 5951614

zbMATH Open1240.90149MaRDI QIDQ3170969FDOQ3170969

Liying Kang, Li-Ying Hou

Publication date: 29 September 2011

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

zbMATH Keywords

competitive ratioonline schedulingreassignmentmachine available time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• Online scheduling to minimize modified total tardiness with an availability constraint

   Recommendations

• Online scheduling with reassignment on two uniform machines 👍 👎
• Online scheduling with rearrangement on two related machines 👍 👎
• Title not available (Why is that?) 👍 👎
• Online scheduling with machine cost and rejection 👍 👎
• Online scheduling with equal processing times and machine eligibility constraints 👍 👎
• On-line scheduling revisited 👍 👎
• Online scheduling on semi-related machines 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines 👍 👎
• Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines 👍 👎

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