Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs (Q1791483)

scientific article; zbMATH DE number 6951060

Language	Label	Description	Also known as
English	Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs	scientific article; zbMATH DE number 6951060

Statements

instance of

scholarly article

0 references

title

Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs (English)

0 references

0 references

0 references

0 references

Applied Mathematical Modelling

0 references

publication date

10 October 2018

0 references

zbMATH Keywords

scheduling

0 references

learning effect

0 references

deteriorating jobs

0 references

due window assignment

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.apm.2013.03.041

0 references

cites work

Q3525911

0 references

Scheduling Deteriorating Jobs on a Single Processor

0 references

Due-date assignment and single machine scheduling with deteriorating jobs

0 references

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

0 references

Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties

0 references

A note on due-date assignment and single-machine scheduling with deteriorating jobs

0 references

Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

0 references

Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

0 references

Single-machine scheduling with nonlinear deterioration

0 references

A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity

0 references

Minimizing makespan in three-machine flow shops with deteriorating jobs

0 references

Scheduling with time dependent processing times: Review and extensions

0 references

A concise survey of scheduling with time-dependent processing times

0 references

Time-dependent scheduling

0 references

Single-machine scheduling with learning considerations

0 references

A state-of-the-art review on scheduling with learning effects

0 references

Single machine scheduling with learning effect considerations

0 references

Scheduling with general position-based learning curves

0 references

A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time

0 references

Single machine scheduling with a general exponential learning effect

0 references

Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects

0 references

A note on scheduling problems with learning effect and deteriorating jobs

0 references

Scheduling with deteriorating jobs and learning effects

0 references

SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING

0 references

Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan

0 references

A due-date assignment problem with learning effect and deteriorating jobs

0 references

Single-machine due-window assignment problem with learning effect and deteriorating jobs

0 references

Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration

0 references

Scheduling problems with general effects of deterioration and learning

0 references

Single-machine scheduling with learning and forgetting effects

0 references

Single Machine Scheduling with Flow Allowances

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Determination of common due window location in a single machine scheduling problem

0 references

Common due window size and location determination in a single machine scheduling problem

0 references

Q3071146

0 references

A due-window assignment problem with position-dependent processing times

0 references

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

0 references

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

0 references

Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times

0 references

Identifiers

zbMATH Open document ID

1426.90143

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1016/J.APM.2013.03.041

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1791483