scientific article; zbMATH DE number 7109369

DOI10.15960/j.cnki.issn.1007-6093.2018.03.011zbMath1438.90104MaRDI QIDQ5197262

Xinxin Han, Cheng He

Publication date: 20 September 2019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityPareto optimal solutionsbatching machinetwo-agent schedulingmaximum cost

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost

This page was built for publication: