A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

scientific article; zbMATH DE number 5599842

Language	Label	Description	Also known as
default for all languages	No label defined
English	A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem	scientific article; zbMATH DE number 5599842

Statements

instance of

scholarly article

0 references

title

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (English)

0 references

0 references

0 references

Journal of Scheduling

0 references

publication date

28 August 2009

0 references

zbMATH Keywords

one-machine scheduling

0 references

earliness-tardiness

0 references

Lagrangean relaxation

0 references

branch-and-bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10951-007-0048-2

0 references

cites work

Near-optimal solutions of large-scale single-machine scheduling problems

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Scheduling identical parallel machines to minimize total weighted completion time

0 references

Preemption in single machine earliness/tardiness scheduling

0 references

A branch and bound approach for single machine scheduling with earliness and tardiness penalties

0 references

Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

0 references

Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer

0 references

Q3993992

0 references

A time indexed formulation of non-preemptive single machine scheduling problems

0 references

A recovering beam search algorithm for the single machine just-in-time scheduling problem

0 references

A dual algorithm for the one-machine scheduling problem

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

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

0 references

Machine scheduling with earliness, tardiness and non-execution penalties

0 references

Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem

0 references

Multicriteria scheduling

0 references

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

0 references

Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates

0 references

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

0 references

Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey

0 references

Q4124328

0 references

A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

0 references

Solving project scheduling problems by minimum cut computations

0 references

Using short-term memory to minimize the weighted number of late jobs on a single machine.

0 references

A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time

0 references

An algorithm for single machine sequencing with deadlines to minimize total weighted completion time

0 references

A Branch and Bound Algorithm for the Total Weighted Tardiness Problem

0 references

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

0 references

Optimal timing of a sequence of tasks with general completion costs

0 references

Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

0 references

The one-machine problem with earliness and tardiness penalties

0 references

An exact approach to early/tardy scheduling with release dates

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

Identifiers

zbMATH Open document ID

1168.90471

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10951-007-0048-2

0 references

Sitelinks

Mathematics(1 entry)

mardi A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem