New results for scheduling to minimize tardiness on one machine with rejection and related problems
type: Item
instance of: scholarly article
title: New results for scheduling to minimize tardiness on one machine with rejection and related problems
zbMATH Open document ID: 1479.90099
published in: Journal of Scheduling
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7443450
zbMATH Keywords: production/scheduling: sequencing
zbMATH Keywords: deterministic
zbMATH Keywords: single machine
author: C. Koulamas
author: George Steiner
MaRDI profile type: Publication
full work available at URL: s10951-020-00671-6
OpenAlex ID: W3094487877
cites work: Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
cites work: Single machine scheduling to minimize total weighted tardiness
cites work: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
cites work: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Techniques for scheduling with rejection
cites work: Job selection in a heavily loaded shop
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
cites work: An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
cites work: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
cites work: Approximation algorithms for minimizing the total weighted tardiness on a single machine
cites work: Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
cites work: Q4124332
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Scheduling
cites work: Algorithms for Scheduling Independent Tasks
cites work: A survey on offline scheduling with rejection
cites work: Revised delivery-time quotation in scheduling with tardiness penalties
cites work: Finding the Pareto-optima for the total and maximum tardiness single machine problem
DOI: 10.1007/S10951-020-00671-6
description: scientific article; zbMATH DE number 7443450