A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
type: Item
instance of: scholarly article
title: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
zbMATH Open document ID: 1458.90281
author: Roberto Cordone
author: Pierre Hosteins
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6988149
zbMATH Keywords: scheduling with rejection
zbMATH Keywords: total tardiness
zbMATH Keywords: bi-objective optimization
zbMATH Keywords: dynamic programming
zbMATH Keywords: branch-and-bound
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.cor.2018.10.006
OpenAlex ID: W2898049951
cites work: A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Bound sets for biobjective combinatorial optimization problems
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4124332
cites work: Multiobjective optimization. Interactive and evolutionary approaches
cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
cites work: Multi-objective branch and bound
cites work: Two-machine flow-shop scheduling with rejection
cites work: A survey on offline scheduling with rejection
cites work: A bicriteria approach to scheduling a single machine with job rejection and positional penalties
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
cites work: Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
cites work: Single-machine scheduling under the job rejection constraint
Wikidata QID: Q129099169
DOI: 10.1016/J.COR.2018.10.006
description: scientific article; zbMATH DE number 6988149