An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 04:15, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	An exact algorithm for the precedence-constrained single-machine scheduling problem	scientific article

Statements

scholarly article

0 references

An exact algorithm for the precedence-constrained single-machine scheduling problem (English)

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

28 July 2015

0 references

full work available at URL

http://hdl.handle.net/2433/174100

0 references

zbMATH Keywords

scheduling

0 references

single-machine

0 references

precedence constraints

0 references

exact algorithm

0 references

Lagrangian relaxation

0 references

dynamic programming

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs

0 references

Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

0 references

A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time

0 references

Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems

0 references

Dual decomposition of a single-machine scheduling problem

0 references

Precedence constrained scheduling to minimize sum of weighted completion times on a single machine

0 references

On the approximability of average completion time scheduling under precedence constraints.

0 references

Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem

0 references

Single-Machine Scheduling with Precedence Constraints

0 references

Approximating Precedence-Constrained Single Machine Scheduling by Coloring

0 references

Scheduling with Precedence Constraints of Low Fractional Dimension

0 references

Single machine precedence constrained scheduling is a Vertex cover problem

0 references

Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling

0 references

Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks

0 references

Dynamic Programming Solution of Sequencing Problems with Precedence Constraints

0 references

One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

0 references

0 references

Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling

0 references

An exact algorithm for single-machine scheduling without machine idle time

0 references

A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

0 references

A dynamic programming method for single machine scheduling

0 references

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

0 references

Dynamic Programming State-Space Relaxation for Single-Machine Scheduling

0 references

New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

0 references

A Branch and Bound Algorithm for the Total Weighted Tardiness Problem

0 references

A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems

0 references

Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability

0 references

An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

0 references

An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

0 references

A survey of algorithms for the single machine total weighted tardiness scheduling problem

0 references

On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2013.02.048

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2355863

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2355863&oldid=39030488"