Single machine scheduling with precedence constraints and SLK due date assignment
From MaRDI portal
Cited in
(14)- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Optimal restricted due date assignment in scheduling
- A survey on offline scheduling with rejection
- Scheduling problems with partially ordered jobs
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect
- A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Due dates assignment and JIT scheduling with equal-size jobs
This page was built for publication: Single machine scheduling with precedence constraints and SLK due date assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667087)