Two-Agent Scheduling on an Unbounded Serial Batching Machine

DOI10.1007/978-3-642-32147-4_38zbMath1370.90117OpenAlexW38793595MaRDI QIDQ3167645

Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_38

zbMATH Keywords

complexityschedulingdynamic programmingmulti-agentserial batching machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (2)

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost

This page was built for publication: Two-Agent Scheduling on an Unbounded Serial Batching Machine