Flow shop scheduling with heterogeneous workers (Q2254003)

From MaRDI portal

Revision as of 16:16, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Flow shop scheduling with heterogeneous workers	scientific article

Statements

scholarly article

0 references

Flow shop scheduling with heterogeneous workers (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ejor.2014.02.012

0 references

Alexander J. Benavides

0 references

0 references

Cristóbal Miralles

0 references

European Journal of Operational Research

0 references

publication date

4 February 2015

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

scheduling

0 references

metaheuristics

0 references

flow shop

0 references

integer programming

0 references

heterogeneous workers

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.ejor.2014.02.012

0 references

0 references

On solving the assembly line worker assignment and balancing problem via beam search

0 references

Flow-shop problems with intermediate buffers

0 references

Ordonnancements à contraintes disjonctives

0 references

A practical use of Jackson's preemptive schedule for solving the job shop problem

0 references

A New Heuristic for Three-Machine Flow Shop Scheduling

0 references

Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems

0 references

Stochastic assembly line balancing using beam search

0 references

Flowshop and Jobshop Schedules: Complexity and Approximation

0 references

0 references

A new constructive heuristic for the flowshop scheduling problem

0 references

A computational study of the permutation flow shop problem based on a tight lower bound

0 references

Scatter search. Methodology and implementation in C. With CD-ROM.

0 references

Flowshop sequencing problems with limited buffer storage

0 references

Tight Bounds for Permutation Flow Shop Scheduling

0 references

A Fast Taboo Search Algorithm for the Job Shop Problem

0 references

Fifty years of scheduling: a survey of milestones

0 references

Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.

0 references

A comprehensive review and evaluation of permutation flowshop heuristics

0 references

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

0 references

Benchmarks for basic scheduling problems

0 references

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

0 references

Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2254003

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