Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem - MaRDI portal

MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem	scientific article

Statements

scholarly article

0 references

MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (English)

0 references

0 references

Michele Garraffa

0 references

Barry O'Sullivan

0 references

0 references

Computers \& Operations Research

0 references

publication date

27 September 2022

0 references

zbMATH Keywords

scheduling

0 references

flowshop

0 references

no-idle

0 references

MILP

0 references

hybrid heuristics

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

0 references

A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time

0 references

Benders decomposition for the mixed no-idle permutation flowshop scheduling problem

0 references

A matheuristic approach for the two-machine total completion time flow shop problem

0 references

A variable neighborhood search based matheuristic for nurse rostering problems

0 references

A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion

0 references

A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem

0 references

The flow shop problem with no-idle constraints: a review and approximation

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion

0 references

A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion

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

A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem

0 references

A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion

0 references

Benchmarks for basic scheduling problems

0 references

A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

0 references

An integer programming approach to the multimode resource-constrained multiproject scheduling problem

0 references

No-wait or no-idle permutation flowshop scheduling with dominating machines

0 references

Identifiers

10.1016/j.cor.2022.105862

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2676278

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