Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Exact algorithms for single-machine scheduling with time windows and precedence constraints

scientific article; zbMATH DE number 6625288

Language	Label	Description	Also known as
default for all languages	No label defined
English	Exact algorithms for single-machine scheduling with time windows and precedence constraints	scientific article; zbMATH DE number 6625288

Statements

instance of

scholarly article

0 references

title

Exact algorithms for single-machine scheduling with time windows and precedence constraints (English)

0 references

author

Morteza Davari

0 references

Roel Leus

0 references

Fabrice Talla Nobibon

0 references

Erik Demeulemeester

0 references

published in

Journal of Scheduling

0 references

publication date

8 September 2016

0 references

full work available at URL

https://lirias.kuleuven.be/handle/123456789/494595

0 references

zbMATH Keywords

single-machine scheduling

0 references

branch and bound

0 references

mixed integer programming

0 references

describes a project that uses

RanGen

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Dynamic Programming State-Space Relaxation for Single-Machine Scheduling

0 references

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

0 references

A new dominance rule to minimize total weighted tardiness with unequal release dates.

0 references

Optimal Reduction of Two-Terminal Directed Acyclic Graphs

0 references

Scheduling with release dates on a single machine to minimize total weighted completion time

0 references

Maximum series-parallel subgraph

0 references

Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer

0 references

Q4658190

0 references

A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem

0 references

Rangen: A random network generator for activity-on-the-node networks

0 references

Formulating the single machine sequencing problem with release dates as a mixed integer program

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

Q4198056

0 references

Single machine scheduling with deadlines, release and due dates

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

An algorithm for single machine sequencing with release dates to minimize total weighted completion time

0 references

A Dynamic Programming Approach to Sequencing Problems

0 references

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

0 references

A dynamic programming method for single machine scheduling

0 references

The concrete delivery problem

0 references

Optimal Sequencing of a Single Machine Subject to Precedence Constraints

0 references

Q4124332

0 references

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

0 references

Q4124328

0 references

The two-machine flow shop problem with arbitrary precedence relations

0 references

Scheduling problems in parallel systems for telecommunications

0 references

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

0 references

An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.

0 references

Scheduling

0 references

Minimizing Weighted Completion Times with Deadlines

0 references

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

0 references

An algorithm for single machine sequencing with deadlines to minimize total weighted completion time

0 references

A Branch and Bound Algorithm for the Total Weighted Tardiness Problem

0 references

Production planning and industrial scheduling. Examples, case studies and applications.

0 references

Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

0 references

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

0 references

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

0 references

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

0 references

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

0 references

The Recognition of Series Parallel Digraphs

0 references

Dual decomposition of a single-machine scheduling problem

0 references

Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs

0 references

Identifiers

zbMATH Open document ID

1347.90037

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10951-015-0428-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Exact algorithms for single-machine scheduling with time windows and precedence constraints