Q4238569 (Q4238569): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 18:17, 28 May 2024

scientific article; zbMATH DE number 1271322

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 1271322

Statements

scholarly article

0 references

0 references

Michael L. Pinedo

0 references

publication date

16 August 1999

0 references

zbMATH Keywords

shifting bottleneck heuristic

0 references

total weighted tardiness

0 references

job shop

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Shifting Bottleneck Procedure for Job Shop Scheduling

0 references

A Computational Study of the Job-Shop Scheduling Problem

0 references

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

0 references

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

0 references

On a routing problem

0 references

The one-machine sequencing problem

0 references

An Algorithm for Solving the Job-Shop Problem

0 references

A modified shifting bottleneck procedure for job-shop scheduling

0 references

Algorithms for Solving Production-Scheduling Problems

0 references

Job-Shop Scheduling by Implicit Enumeration

0 references

0 references

Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4238569

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