An approximate algorithm for the uniform machine scheduling problem with job splitting property

zbMATH Open1249.90088MaRDI QIDQ2886474FDOQ2886474

Authors: Qiuya Zheng, Zunhuan Shen, Weiqiong Wang 

Publication date: 1 June 2012

Published in: Journal of Guangxi University. Natural Science Edition (Search for Journal in Brave)

Recommendations

• Parallel machine scheduling considering a job-splitting property
• Uniform machine scheduling with machine available constraints
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
• Splitting versus setup trade-offs for scheduling to minimize weighted completion time
• Scheduling Jobs on Several Machines with the Job Splitting Property

zbMATH Keywords

schedulingcompletion timeapproximate algorithmsplittinguniform machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Stochastic scheduling theory in operations research (90B36)

Cited In (1)

• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

This page was built for publication: An approximate algorithm for the uniform machine scheduling problem with job splitting property

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