New results for scheduling to minimize tardiness on one machine with rejection and related problems
From MaRDI portal
Publication:2061129
DOI10.1007/S10951-020-00671-6zbMath1479.90099OpenAlexW3094487877MaRDI QIDQ2061129
George Steiner, Christos P. Koulamas
Publication date: 13 December 2021
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-020-00671-6
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection ⋮ Machine scheduling with job rejection and Dejong's learning effect ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- A survey on offline scheduling with rejection
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- Job selection in a heavily loaded shop
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- Single machine scheduling to minimize total weighted tardiness
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
- An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
- Minimizing Total Tardiness on One Machine is NP-Hard
- Algorithms for Scheduling Independent Tasks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Techniques for scheduling with rejection
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Scheduling
This page was built for publication: New results for scheduling to minimize tardiness on one machine with rejection and related problems
