A hybrid heuristic approach for single machine scheduling with release times
type: Item
instance of: scholarly article
title: A hybrid heuristic approach for single machine scheduling with release times
zbMATH Open document ID: 1348.90250
author: Fabio Salassa
author: Vincent T'kindt
author: F. Della Croce
published in: Computers \& Operations Research
publication date: 2016-11-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6650639
zbMATH Keywords: integer programming
zbMATH Keywords: matheuristics
zbMATH Keywords: positional completion times
MaRDI profile type: Publication
full work available at URL: j.cor.2013.11.016
OpenAlex ID: W1986426354
cites work: Q4017560
cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
cites work: A matheuristic approach for the two-machine total completion time flow shop problem
cites work: A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
cites work: Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time
cites work: Local branching
cites work: Dominance-based heuristics for one-machine total cost scheduling problems
cites work: Matheuristics
cites work: Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
cites work: Revisiting branch and bound search strategies for machine scheduling problems
cites work: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
DOI: 10.1016/J.COR.2013.11.016
description: scientific article; zbMATH DE number 6650639