An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times (Q6090764): Difference between revisions

Latest revision as of 12:41, 19 August 2024

scientific article; zbMATH DE number 7767930

Language	Label	Description	Also known as
English	An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times	scientific article; zbMATH DE number 7767930

Statements

instance of

scholarly article

0 references

title

An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times (English)

0 references

author

Q6090763

0 references

published in

Communications in Computer and Information Science

0 references

publication date

17 November 2023

0 references

zbMATH Keywords

single machine scheduling problem

0 references

inserted idle time

0 references

worst-case performance ratio

0 references

approximation algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Q4124328

0 references

A branch and bound method for the job-shop problem with sequence-dependent setup times

0 references

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

0 references

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

0 references

Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better

0 references

An approximation algorithm for a single-machine scheduling problem with release times and delivery times

0 references

The one-machine sequencing problem

0 references

A block approach for single-machine scheduling with release dates and due dates

0 references

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

0 references

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

0 references

Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

0 references

Identifiers

zbMATH Open document ID

1527.90099

0 references

DOI

10.1007/978-3-031-22990-9_6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6090764

@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound method for the job-shop problem 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
@@ Property / cites work @@
+Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
+Normal rank
@@ Property / cites work @@
+Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for a single-machine scheduling problem with release times and delivery times
+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 block approach for single-machine scheduling with release dates and due dates
+Normal rank
@@ Property / cites work @@
+On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
+Normal rank
@@ Property / cites work @@
+Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
+Normal rank