Metaheuristics for a scheduling problem with rejection and tardiness penalties
type: Item
instance of: scholarly article
title: Metaheuristics for a scheduling problem with rejection and tardiness penalties
zbMATH Open document ID: 1310.90056
author: Simon Thevenin
author: Nicolas Zufferey
author: Marino Widmer
published in: Journal of Scheduling
publication date: 2015-03-26T00:00:00Z
full work available at URL: 10951 2014 Article 395.pdf
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6419714
zbMATH Keywords: scheduling
zbMATH Keywords: metaheuristics
zbMATH Keywords: order acceptance
zbMATH Keywords: setups
describes a project that uses: Tabu search
MaRDI profile type: Publication
OpenAlex ID: W2070377403
cites work: A new dominance rule to minimize total weighted tardiness with unequal release dates.
cites work: Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
cites work: Scheduling a single machine to minimize a regular objective function under setup constraints
cites work: A bicriteria approach to scheduling a single machine with job rejection and positional penalties
cites work: A unified framework for population-based metaheuristics
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Handbook of metaheuristics
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
cites work: A framework for the description of evolutionary algorithms
cites work: Dominance-based heuristics for one-machine total cost scheduling problems
cites work: Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
cites work: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
cites work: Scheduling
cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Order acceptance using genetic algorithms
cites work: Adaptive memory programming: a unified view of metaheuristics
cites work: Multi-neighborhood tabu search for the maximum weight clique problem
cites work: Permutation flow shop scheduling with order acceptance and weighted tardiness
cites work: Single machine scheduling with release dates and rejection
cites work: Graph colouring approaches for a satellite range scheduling problem
DOI: 10.1007/S10951-014-0395-8
description: scientific article; zbMATH DE number 6419714