Just-in-Time Scheduling with Equal-Size Jobs (Q2958671)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Just-in-Time Scheduling with Equal-Size Jobs	scientific article

Statements

scholarly article

0 references

Just-in-Time Scheduling with Equal-Size Jobs (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-1-4614-1123-9_6

0 references

Nguyen Huynh Toung

0 references

0 references

Just-in-Time Systems

0 references

publication date

3 February 2017

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-1123-9_6

0 references

0 references

A Fast and Simple Algorithm for the Maximum Flow Problem

0 references

Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines

0 references

Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

0 references

Edge-coloring bipartite multigraphs in \(O(E \log D)\) time

0 references

Due-date assignment and early/tardy scheduling on identical parallel machines

0 references

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

0 references

0 references

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties

0 references

A new approach to the maximum-flow problem

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date

0 references

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

0 references

Scheduling around a small common due date

0 references

New Lower and Upper Bounds for Scheduling Around a Small Common Due Date

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

Due dates assignment and JIT scheduling with equal-size jobs

0 references

Algorithms for minclique scheduling problems

0 references

Minimizing the average deviation of job completion times about a common due date

0 references

A Decomposition Theorem for Maximum Weight Bipartite Matchings

0 references

A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem

0 references

Equivalence of mean flow time problems and mean absolute deviation problems

0 references

Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs

0 references

Due-date assignment on uniform machines

0 references

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

0 references

New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

0 references

Parallel machine earliness and tardiness scheduling with proportional weights

0 references

0 references

The complexity of scheduling job families about a common due date

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2958671

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