scientific article; zbMATH DE number 6453531

DOI10.3969/J.ISSN.1673-5862.2014.04.003zbMATH Open1324.90068MaRDI QIDQ5260122FDOQ5260122

Qi Zhang, Chengxin Luo

Publication date: 29 June 2015

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

zbMATH Keywords

parallel machine schedulingfully polynomial-time approximation schemenon-availability interval

Mathematics Subject Classification ID

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

Cited In (3)

• A PTAS for a resource scheduling problem with arbitrary number of parallel machines
• Optimal parallel machines scheduling with availability constraints
• Machine scheduling with availability constraints

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Machine scheduling with an availability constraint 👍 👎
• Parallel machine scheduling with machine availability and eligibility constraints 👍 👎
• Approximation schemes for parallel machine scheduling with availability constraints 👍 👎
• Parallel machines scheduling with nonsimultaneous machine available time 👍 👎
• Optimal parallel machines scheduling with availability constraints 👍 👎
• Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints 👍 👎
• Rescheduling of identical parallel machines under machine eligibility constraints. 👍 👎
• Parallel-machine scheduling with time-dependent and machine availability constraints 👍 👎

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