Scheduling a single machine with multiple due dates per job
From MaRDI portal
Publication:6657886
DOI10.1007/S10951-024-00825-WMaRDI QIDQ6657886
Raphael Kühn, Christian Weiß, Sandy Heydrich, Heiner Ackermann
Publication date: 7 January 2025
Published in: Journal of Scheduling (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Optimal restricted due date assignment in scheduling
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- Two due date assignment problems in scheduling a single machine
- Survey of scheduling research involving due date determination decisions
- Scheduling equal-length jobs on identical parallel machines
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Scheduling a proportionate flow shop of batching machines
This page was built for publication: Scheduling a single machine with multiple due dates per job
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657886)
