Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252)

!

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

Minimizing earliness and tardiness costs in stochastic scheduling

scientific article; zbMATH DE number 6467091

Language	Label	Description	Also known as
default for all languages	No label defined
English	Minimizing earliness and tardiness costs in stochastic scheduling	scientific article; zbMATH DE number 6467091

Statements

instance of

scholarly article

0 references

title

Minimizing earliness and tardiness costs in stochastic scheduling (English)

0 references

author

Kenneth R. Baker

0 references

published in

European Journal of Operational Research

0 references

publication date

29 July 2015

0 references

zbMATH Keywords

sequencing

0 references

stochastic scheduling

0 references

earliness/tardiness

0 references

branch and bound

0 references

neighborhood search

0 references

due-date assignment

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2013.12.011

0 references

cites work

Dynamic Programming State-Space Relaxation for Single-Machine Scheduling

0 references

Setting optimal due dates in a basic safe-scheduling model

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Principles of Sequencing and Scheduling

0 references

Safe scheduling: Setting due dates in single-machine problems

0 references

Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

0 references

Q4354550

0 references

Single machine sequencing with random processing times and random due‐dates

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

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

Machine scheduling with earliness, tardiness and non-execution penalties

0 references

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

0 references

Dynamic scheduling of stochastic jobs on a single machine

0 references

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

0 references

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

0 references

Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem

0 references

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

0 references

Single machine earliness and tardiness scheduling

0 references

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

0 references

Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

0 references

The Single Machine Early/Tardy Problem

0 references

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

0 references

Setting due dates in a stochastic single machine environment

0 references

Scheduling with Random Service Times

0 references

Sequencing jobs on a single machine with a common due data and stochastic processing times

0 references

Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

0 references

Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

0 references

Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs

0 references

The stochastic single machine scheduling problem with earliness and tardiness costs

0 references

Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints

0 references

Job sequencing and due date assignment in a single machine shop with uncertain processing times

0 references

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

0 references

Identifiers

zbMATH Open document ID

1317.90136

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2013.12.011

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2356252