scientific article; zbMATH DE number 1462526

MaRDI QIDQ4486916zbMATH OpenFDO

Authors Jianmei Zhu

Publication date 22 November 2000

zbMATH Keywords

algorithmnumber of tardy jobsscheduling problemsingle machinestrong NP-hardnessvariable processing time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1322689
• A class of single machine scheduling problem with variable processing time
• A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Single machine scheduling to minimize the number of early and tardy jobs

Cited in

(2)

• A class of single machine scheduling problem with variable processing time
• scientific article; zbMATH DE number 1322689 (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 Q4486916)