Parallel scheduling problem with non-simultaneous machine available times

MaRDI QIDQ3014094zbMATH OpenFDO

Authors Weidong Li, Jianbo Li, Jianping Li, Tongquan Zhang

Publication date 19 July 2011

zbMATH Keywords

schedulingpolynomial-time approximation schememachine available times

Mathematics Subject Classification ID

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

Recommendations

• Parallel-machine scheduling with non-simultaneous machine available time
• Parallel machines scheduling with nonsimultaneous machine available time
• The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
• scientific article; zbMATH DE number 5583893
• scientific article; zbMATH DE number 1932350

Cited in

(10)

• The worst-case ratio of algorithm \(A_{KK}\) for parallel machines scheduling with non-simultaneous machine available times
• Parallel machines scheduling with nonsimultaneous machine available time
• scientific article; zbMATH DE number 6453531 (Why is no real title available?)
• scientific article; zbMATH DE number 2219502 (Why is no real title available?)
• A note on parallel machine scheduling with non-simultaneous machine available time
• On a parallel machine scheduling problem with equal processing times
• Two parallel machines scheduling with one availability constraint and jobs with delivery times
• Multiple parallel-batch machines scheduling with additive resource assignment and machine available times
• Scheduling problem with multi-purpose parallel machines
• Parallel-machine scheduling with non-simultaneous machine available time

This page was built for publication: Parallel scheduling problem with non-simultaneous machine available times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014094)