Preemption in single machine earliness/tardiness scheduling (Q835565)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

Preemption in single machine earliness/tardiness scheduling

scientific article; zbMATH DE number 5599834

Language	Label	Description	Also known as
default for all languages	No label defined
English	Preemption in single machine earliness/tardiness scheduling	scientific article; zbMATH DE number 5599834

Statements

instance of

scholarly article

0 references

title

Preemption in single machine earliness/tardiness scheduling (English)

0 references

0 references

0 references

0 references

Journal of Scheduling

0 references

publication date

28 August 2009

0 references

zbMATH Keywords

single-machine scheduling

0 references

earliness

0 references

tardiness

0 references

preemption

0 references

transportation problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10951-007-0028-6

0 references

cites work

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs

0 references

Single-machine scheduling with early and tardy completion costs

0 references

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

0 references

A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden

0 references

Single machine scheduling to minimize mean absolute lateness: A heuristic solution

0 references

A branch and bound procedure to minimize mean absolute lateness on a single processor

0 references

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties

0 references

Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Generating Experimental Data for Computational Testing with Machine Scheduling Applications

0 references

A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time

0 references

Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates

0 references

A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

0 references

Q4124328

0 references

A heuristic for single machine scheduling with early and tardy costs

0 references

Scheduling with deadlines and loss functions

0 references

Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times

0 references

Minimizing average completion time in the presence of release dates

0 references

A decomposition algorithm for the single machine total tardiness problem

0 references

The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions

0 references

The one-machine problem with earliness and tardiness penalties

0 references

A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems

0 references

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

0 references

Q4032003

0 references

Optimal timing schedules in earliness-tardiness single machine sequencing

0 references

Single machine scheduling with symmetric earliness and tardiness penalties

0 references

Single-machine scheduling of unit-time jobs with earliness and tardiness penalties

0 references

Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

0 references

Algorithms for a class of single-machine weighted tardiness and earliness problems

0 references

Identifiers

zbMATH Open document ID

1168.90427

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10951-007-0028-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Preemption in single machine earliness/tardiness scheduling