Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:47, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times	scientific article

Statements

scholarly article

0 references

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (English)

0 references

Vahid Kayvanfar

0 references

0 references

0 references

Mostafa Zandieh

0 references

Computers \& Operations Research

0 references

publication date

10 November 2016

0 references

zbMATH Keywords

total earliness and tardiness

0 references

makespan

0 references

just-in-time

0 references

controllable processing times

0 references

unrelated parallel machines

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

Single machine scheduling with common due date and controllable processing times

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Parallel machine earliness and tardiness scheduling with proportional weights

0 references

Generating Experimental Data for Computational Testing with Machine Scheduling Applications

0 references

Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms

0 references

Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

0 references

Scheduling unrelated parallel machines with sequence-dependent setups

0 references

The Total Tardiness Problem: Review and Extensions

0 references

Scheduling unrelated parallel machines to minimize total weighted tardiness.

0 references

A state-of-the-art review of parallel-machine scheduling research

0 references

Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

0 references

Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

0 references

Parallel machine scheduling with earliness and tardiness penalties

0 references

Multiple-machine scheduling with earliness, tardiness and completion time penalties

0 references

Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.

0 references

Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates

0 references

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

0 references

Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

0 references

Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects

0 references

Total absolute deviation of job completion times on uniform and unrelated machines

0 references

Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization

0 references

A survey of results for sequencing problems with controllable processing times

0 references

A survey of scheduling with controllable processing times

0 references

A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

0 references

Two parallel machine sequencing problems involving controllable job processing times

0 references

Approximation schemes for parallel machine scheduling problems with controllable processing times

0 references

Scheduling parallel CNC machines with time/cost trade-off considerations

0 references

An anticipative scheduling approach with controllable processing times

0 references

Parallel machine match-up scheduling with manufacturing cost considerations

0 references

Just-in-time scheduling with controllable processing times on parallel machines

0 references

Parallel machine scheduling models with fuzzy processing times

0 references

Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment

0 references

Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory

0 references

0 references

0 references

0 references

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.COR.2013.08.003

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:336752

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