Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (Q1667833): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 02:00, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity	scientific article

Statements

scholarly article

0 references

Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (English)

0 references

0 references

0 references

0 references

0 references

Applied Mathematical Modelling

0 references

publication date

30 August 2018

0 references

zbMATH Keywords

scheduling

0 references

rate-modifying activity

0 references

resource allocation

0 references

learning effect

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

Single-machine scheduling with learning considerations

0 references

Scheduling problems with a learning effect

0 references

Scheduling jobs with position-dependent processing times

0 references

Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

0 references

A note on single-machine scheduling with job-dependent learning effects

0 references

Scheduling with general job-dependent learning curves.

0 references

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

0 references

Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect

0 references

Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration

0 references

Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect

0 references

Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

0 references

Single machine scheduling subject to deadlines and resource dependent processing times

0 references

Some comments on sequencing with controllable processing times

0 references

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

0 references

Convex resource allocation for minimizing the makespan in a single machine with job release dates

0 references

Minimizing the total weighted flow time in a single machine with controllable processing times

0 references

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

0 references

A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times

0 references

A survey of scheduling with controllable processing times

0 references

Machine scheduling with a rate-modifying activity

0 references

Single-machine scheduling with maintenance and repair rate-modifying activities

0 references

Single machine scheduling with a restricted rate-modifying activity

0 references

Due-date assignment and maintenance activity scheduling problem

0 references

A note: Common due date assignment for a single machine scheduling with the rate-modifying activity

0 references

Two-parallel machines scheduling with rate-modifying activities to minimize total completion time

0 references

Scheduling a maintenance activity and due-window assignment on a single machine

0 references

Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance

0 references

Scheduling with job-dependent learning effects and multiple rate-modifying activities

0 references

A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration

0 references

Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

0 references

0 references

Single machine scheduling problem with controllable processing times and resource dependent release times

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.APM.2012.09.072

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1667833

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