Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 08:23, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Heuristics for a flowshop scheduling problem with stepwise job objective function	scientific article

Statements

scholarly article

0 references

Heuristics for a flowshop scheduling problem with stepwise job objective function (English)

0 references

Luciana S. Pessoa

0 references

Carlos E. Andrade

0 references

European Journal of Operational Research

0 references

publication date

30 May 2018

0 references

zbMATH Keywords

flowshop scheduling

0 references

heuristics

0 references

metaheuristics

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.2017.10.045

0 references

A hybrid primal heuristic for finding feasible solutions to mixed integer programs

0 references

0 references

0 references

A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning

0 references

A $k$-Sample Model in Order Statistics

0 references

Minimizing tardy jobs in a flowshop with common due date

0 references

Scheduling jobs on parallel machines to minimize a regular step total cost function

0 references

An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

0 references

A genetic algorithm for the weight setting problem in OSPF routing

0 references

Iterated greedy local search methods for unrelated parallel machine scheduling

0 references

Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules

0 references

A new set of high-performing heuristics to minimise flowtime in permutation flowshops

0 references

A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation

0 references

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective

0 references

Handbook of metaheuristics

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Flowshop scheduling research after five decades

0 references

Variable Neighborhood Search

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

0 references

0 references

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

0 references

0 references

Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates

0 references

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization

0 references

A genetic algorithm for flowshop sequencing

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

An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

0 references

Single machine scheduling with delivery dates and cumulative payoffs

0 references

Performance guarantees for a scheduling problem with common stepwise job payoffs

0 references

0 references

Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion

0 references

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

0 references

Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2017.10.045

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1754167

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