Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Metaheuristics for solving a flexible flow‐shop scheduling problem with s‐batching machines
Metaheuristics for solving a flexible flow‐shop scheduling problem with s‐batching machines
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Jens Rocholl
,
Lars Mönch
Format:
Artículo Open Access
Published:
Wiley
2024
Subjects:
International Transactions in Operational Research
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Description
DOI:
10.1111/itor.13491
Similar Items
Job‐shop scheduling with cooperative transportation resources
by: Jean‐Philippe Gayon, et al.
Published: (2025)
A fast local search for the identical parallel machine scheduling problem with the position‐based deteriorating effect and maintenance
by: Radosław Rudek
Published: (2025)
Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs
by: Roberto Maria Rosati, et al.
Published: (2026)
Multi‐neighborhood simulated annealing for the home healthcare routing and scheduling problem
by: Sara Ceschia, et al.
Published: (2024)
Special issue on “Metaheuristics: Advances and Applications”
Published: (2024)