Single-machine scheduling with coupled task and rejection

DOI10.3934/MFC.2023008MaRDI QIDQ6633206

Fanyu Kong, Yujia Huo, Cuixia Miao, Author name not available (Why is that?)

Publication date: 5 November 2024

Published in: Mathematical Foundations of Computing (Search for Journal in Brave)

zbMATH Keywords

single-machine schedulingapproximation algorithmrejectionpolynomially solvablecoupled task

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• A survey on offline scheduling with rejection
• Scheduling coupled-operation jobs with exact time-lags
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Single machine scheduling with release dates and rejection
• Two-agent parallel-machine scheduling with rejection
• Scheduling coupled tasks with exact delays for minimum total job completion time
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Scheduling coupled tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Radar pulse interleaving for multi‐target tracking
• Multiprocessor Scheduling with Rejection
• On the complexity of coupled-task scheduling
• Machine scheduling with job rejection and Dejong's learning effect

This page was built for publication: Single-machine scheduling with coupled task and rejection

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