Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity

DOI10.1007/s10951-019-00613-xzbMath1430.90273OpenAlexW2962248155MaRDI QIDQ2286437

Dmitrij Šešok, Mikhail Y. Kovalyov

Publication date: 22 January 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-019-00613-x

zbMATH Keywords

computational complexityschedulingbatchingdeteriorationagent scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Online scheduling with deterioration and unexpected processor breakdown ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine

Cites Work

• Unnamed Item
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Scheduling a batching machine
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

This page was built for publication: Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity