Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

DOI10.1016/j.ejor.2016.10.024zbMath1394.90310MaRDI QIDQ1751665

Joseph Y.-T. Leung, Ying-Qian Zhang, Jun-Qiang Wang, Guo-Qiang Fan, Cheng-Wu Zhang

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.10.024

zbMATH Keywords

heuristics; scheduling; NP-hardness; two-agent scheduling; parallel-batching machine

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

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