Earliness-tardiness scheduling with setup considerations (Q1777159)

From MaRDI portal

Revision as of 10:39, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Earliness-tardiness scheduling with setup considerations	scientific article

Statements

scholarly article

0 references

Earliness-tardiness scheduling with setup considerations (English)

0 references

0 references

Computers \& Operations Research

0 references

publication date

12 May 2005

0 references

zbMATH Keywords

Earliness-tardiness scheduling

0 references

Setup times

0 references

MIP formulation

0 references

Branch-and-bound

0 references

Heuristics

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2003.12.002

0 references

The complexity of scheduling job families about a common due date

0 references

Scheduling with batch setup times and earliness-tardiness penalties

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Multicriteria scheduling problems: a survey

0 references

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties

0 references

Single-machine scheduling with early and tardy completion costs

0 references

Optimal timing schedules in earliness-tardiness single machine sequencing

0 references

PERT scheduling with convex cost functions.

0 references

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

0 references

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

0 references

The one-machine problem with earliness and tardiness penalties

0 references

A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem

0 references

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

0 references

Single machine scheduling with symmetric earliness and tardiness penalties

0 references

Scheduling job families about an unrestricted common due date on a single machine

0 references

A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

0 references

A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

0 references

Early/tardy scheduling with sequence dependent setups on uniform parallel machines

0 references

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

0 references

Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

0 references

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

0 references

Tight LP bounds for resource constrained project scheduling

0 references

The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.COR.2003.12.002

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1777159

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