scientific article; zbMATH DE number 1497368

MaRDI QIDQ4499052zbMATH OpenFDO

Authors Chunjie Su, Enyu Yao

Publication date 2 May 2001

zbMATH Keywords

algorithmcomplexityworst-case bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Complexity results for parallel machine problems with a single server
• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Scheduling with multiple servers
• An approximation algorithm for parallel machine scheduling with a common server
• Approximate algorithms for the \(P\parallel C_{\max}\) problem

Cited in

(3)

• An approximation algorithm for parallel machine scheduling with a common server
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• scientific article; zbMATH DE number 5525401 (Why is no real title available?)

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