An integer programming approach to optimal basic block instruction scheduling for single-issue processors
type: Item
instance of: scholarly article
title: An integer programming approach to optimal basic block instruction scheduling for single-issue processors
zbMATH Open document ID: 1387.90137
author: Michael Jünger
author: Sven Mallach
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68M07
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68W01
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6872096
zbMATH Keywords: instruction scheduling
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-cut
describes a project that uses: ABACUS
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.10.003
OpenAlex ID: W2226668172
cites work: Q4003964
cites work: Single machine scheduling subject to precedence delays
cites work: Scheduling expressions on a pipelined processor with a maximal delay of one cycle
cites work: Approximation algorithms for scheduling arithmetic expressions on pipelined machines
cites work: Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
cites work: Q4475675
cites work: Data-dependency graph transformations for instruction scheduling
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Q4473034
cites work: Q4198056
cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
cites work: The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
cites work: An algorithm for the single machine sequencing problem with precedence constraints
cites work: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
cites work: Q3204309
cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program
cites work: Single-Machine Scheduling with Precedence Constraints
cites work: Q4035632
cites work: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
cites work: A Cutting Plane Algorithm for the Linear Ordering Problem
cites work: Facets of the linear ordering polytope
cites work: Q4735939
cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
DOI: 10.1016/J.DISOPT.2015.10.003
description: scientific article; zbMATH DE number 6872096