An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478): Difference between revisions

Latest revision as of 11:57, 29 July 2024

scientific article; zbMATH DE number 7548827

Language	Label	Description	Also known as
English	An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints	scientific article; zbMATH DE number 7548827

Statements

instance of

scholarly article

0 references

title

An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (English)

0 references

zbMATH Open document ID

1492.90062

0 references

DOI

10.1287/ijoc.2020.0988

0 references

0 references

0 references

0 references

INFORMS Journal on Computing

0 references

publication date

27 June 2022

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

combinatorial optimization

0 references

one-machine scheduling

0 references

branch-and-bound

0 references

describes a project that uses

GitHub

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1287/ijoc.2020.0988

0 references

OpenAlex ID

W3100759455

0 references

cites work

Mixed Integer Programming: Analyzing 12 Years of Progress

0 references

The Shifting Bottleneck Procedure for Job Shop Scheduling

0 references

Sequencing with due-dates and early start times to minimize maximum tardiness

0 references

The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling

0 references

Constraint-based scheduling: Applying constraint programming to scheduling problems.

0 references

An efficient ILP formulation for the single machine scheduling problem

0 references

The one-machine sequencing problem

0 references

A modified shifting bottleneck procedure for job-shop scheduling

0 references

Q4198056

0 references

Jackson's semi-preemptive scheduling on a single machine

0 references

A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem

0 references

Minimizing maximum lateness on one machine: computational experience and some applications

0 references

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

0 references

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

0 references

Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams

0 references

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

0 references

Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem

0 references

Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

0 references

A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem

0 references

A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times

0 references

Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5085478

@@ Property / cites work @@
+Mixed Integer Programming: Analyzing 12 Years of Progress
+Normal rank
@@ Property / cites work @@
+The Shifting Bottleneck Procedure for Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Sequencing with due-dates and early start times to minimize maximum tardiness
+Normal rank
@@ Property / cites work @@
+The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Constraint-based scheduling: Applying constraint programming to scheduling problems.
+Normal rank
@@ Property / cites work @@
+An efficient ILP formulation for the single machine scheduling problem
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+A modified shifting bottleneck procedure for job-shop scheduling
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Jackson's semi-preemptive scheduling on a single machine
+Normal rank
@@ Property / cites work @@
+A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness on one machine: computational experience and some applications
+Normal rank
@@ Property / cites work @@
+On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
+Normal rank
@@ Property / cites work @@
+Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
+Normal rank
@@ Property / cites work @@
+Cyclic best first search: Using contours to guide branch‐and‐bound algorithms
+Normal rank
@@ Property / cites work @@
+Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
+Normal rank
@@ Property / cites work @@
+Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
+Normal rank
@@ Property / cites work @@
+A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
+Normal rank
@@ Property / cites work @@
+A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
+Normal rank
@@ Property / cites work @@
+Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
+Normal rank