\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
type: Item
instance of: scholarly article
title: \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem
author: Matthias Horn
author: Johannes Maschler
author: Günther R. Raidl
author: Elina Rönnberg
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350522
zbMATH Keywords: decision diagrams
zbMATH Keywords: \( \mathrm{A}^*\) search
zbMATH Keywords: scheduling
zbMATH Keywords: sequencing
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105125
OpenAlex ID: W2906165405
cites work: On finding the optimal BDD relaxation
cites work: Optimization Bounds from Binary Decision Diagrams
cites work: Decision diagrams for optimization
cites work: Discrete optimization with decision diagrams
cites work: An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: Multivalued Decision Diagrams for Sequencing Problems
cites work: A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
cites work: Assortment optimization over time
cites work: Orienteering problem: a survey of recent variants, solution approaches and applications
cites work: A survey of variants and extensions of the resource-constrained project scheduling problem
cites work: Decision Diagrams and Dynamic Programming
cites work: Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
cites work: Q4821303
cites work: Hybrid optimization methods for time-dependent sequencing problems
cites work: A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
cites work: Q5628016
cites work: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
cites work: πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Q4040221
cites work: A local search framework for compiling relaxed decision diagrams
cites work: Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
cites work: Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
DOI: 10.1016/J.COR.2020.105125
description: scientific article; zbMATH DE number 7350522