Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950)

scientific article

Language	Label	Description	Also known as
English	Simple matching vs linear assignment in scheduling models with positional effects: a critical review	scientific article

Statements

instance of

scholarly article

0 references

title

Simple matching vs linear assignment in scheduling models with positional effects: a critical review (English)

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

29 December 2012

0 references

zbMATH Keywords

scheduling

0 references

single machine

0 references

parallel machines

0 references

positional effects

0 references

job deterioration

0 references

assignment problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

cites work

Scheduling jobs with position-dependent processing times

0 references

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

0 references

Single-machine scheduling with learning considerations

0 references

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

0 references

An extension of the Munkres algorithm for the assignment problem to rectangular matrices

0 references

Q3425131

0 references

Scheduling independent tasks to reduce mean finishing time

0 references

Assignment Problems

0 references

A concise survey of scheduling with time-dependent processing times

0 references

Q4658190

0 references

Q3549563

0 references

A note on scheduling on a single processor with speed dependent on a number of executed jobs

0 references

Time-dependent scheduling

0 references

Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation

0 references

Q4821818

0 references

Single machine scheduling and due date assignment with positionally dependent processing times

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Q4758141

0 references

A survey of variants and extensions of the resource-constrained project scheduling problem

0 references

Technical Note—Minimizing Average Flow Time with Parallel Machines

0 references

Scheduling Problems with Learning and Ageing Effects: A Survey

0 references

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

0 references

Two-machine flow shop no-wait scheduling with machine maintenance

0 references

Planning Machine Maintenance in Two-Machine Shop Scheduling

0 references

Q5519710

0 references

Single machine scheduling with past-sequence-dependent setup times and learning effects

0 references

Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect

0 references

A unified approach for scheduling with convex resource consumption functions using positional penalties

0 references

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

0 references

Scheduling problems with a learning effect

0 references

Parallel machine scheduling with a learning effect

0 references

A note on scheduling deteriorating jobs

0 references

Scheduling with general job-dependent learning curves.

0 references

Scheduling a deteriorating maintenance activity on a single machine

0 references

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

0 references

Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine

0 references

Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines

0 references

Q3076093

0 references

A survey of scheduling with controllable processing times

0 references

A note on scheduling problems with learning effect and deteriorating jobs

0 references

Project scheduling with finite or infinite number of activity processing modes -- a survey

0 references

A comment on scheduling two parallel machines with capacity constraints

0 references

Single-machine scheduling problems with a learning effect

0 references

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

0 references

Single-machine scheduling with both deterioration and learning effects

0 references

Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities

0 references

Some scheduling problems with general position-dependent and time-dependent learning effects

0 references

Some single-machine scheduling problems with general effects of learning and deterioration

0 references

Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan

0 references

Identifiers

zbMATH Open document ID

1253.90117

0 references

DOI

10.1016/j.ejor.2012.04.037

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1926950