Unbounded parallel-batch scheduling with family jobs and delivery coordination

From MaRDI portal
Publication:1944952


DOI10.1016/j.ipl.2011.03.014zbMath1260.68039MaRDI QIDQ1944952

Jinjiang Yuan, Baoqiang Fan, Shi-Sheng Li

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.014


68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms


Related Items



Cites Work