Flow shop scheduling problem with position-dependent processing times (Q2273687): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 19:37, 4 August 2024

scientific article

Language	Label	Description	Also known as
English	Flow shop scheduling problem with position-dependent processing times	scientific article

Statements

scholarly article

0 references

Flow shop scheduling problem with position-dependent processing times (English)

0 references

Santiago Sánchez-Herrera

0 references

Jairo R. Montoya-Torres

0 references

Elyn L. Solano-Charris

0 references

Computers \& Operations Research

0 references

publication date

25 September 2019

0 references

zbMATH Keywords

scheduling

0 references

flow shop

0 references

position-dependent processing times

0 references

iterated local search

0 references

greedy randomized adaptive search procedure

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

Survey, categorization, and comparison of recent tour scheduling literature

0 references

Human performance modelling as an aid in the process of manufacturing system design: A pilot study

0 references

0 references

Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs

0 references

A concise survey of scheduling with time-dependent processing times

0 references

An annotated bibliography of GRASP-Part II: Applications

0 references

Time-dependent scheduling

0 references

Machine scheduling problems with a position-dependent deterioration

0 references

Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues

0 references

Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates

0 references

Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times

0 references

Some heuristics for no-wait flowshops with total tardiness criterion

0 references

A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime

0 references

A note on scheduling deteriorating jobs

0 references

0 references

A decomposition algorithm for the single machine total tardiness problem

0 references

Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

0 references

Scheduling on parallel processors with varying processing times

0 references

Benchmarks for basic scheduling problems

0 references

A note on the complexity of flow-shop scheduling with deteriorating jobs

0 references

Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

0 references

Single machine scheduling with stochastically dependent times

0 references

Flow shop scheduling jobs with position-dependent processing times

0 references

Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties

0 references

Minimizing makespan in three-machine flow shops with deteriorating jobs

0 references

Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities

0 references

A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.cor.2019.06.015

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2273687

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