Single-machine primary-secondary scheduling with total tardiness being the primary criterion

DOI10.1007/S10951-023-00793-7zbMATH Open1543.9012MaRDI QIDQ6577347

Jinjiang Yuan, Qiu-Lan Zhao

Publication date: 23 July 2024

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

zbMATH Keywords

schedulingsingle machinetotal tardinesspseudo-polynomial timeprimary-secondary

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• Multicriteria scheduling
• Complexity of two dual criteria scheduling problems
• Complexity of single machine hierarchical scheduling: A survey
• A new decomposition approach for the single machine total tardiness scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
• Algorithms for Scheduling Independent Tasks
• Multiagent Scheduling
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Single machine scheduling with release times, deadlines and tardiness objectives

This page was built for publication: Single-machine primary-secondary scheduling with total tardiness being the primary criterion

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