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

DOI10.1007/S10951-019-00613-XMaRDI QIDQ2286437zbMATH OpenOpenAlexFDO

Authors M. Y. Kovalyov, Dmitrij Šešok

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

agent schedulingbatchingcomputational complexitydeteriorationscheduling

Mathematics Subject Classification ID

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

Recommendations

• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
• Single machine two-agent scheduling with deteriorating jobs
• Single machine parallel-batch scheduling with deteriorating jobs
• Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

Cites work

• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Scheduling a batching machine

Cited in

(6)

• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
• 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
• Unbounded parallel-batch scheduling to minimize the total weighted tardy span

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286437)