scientific article; zbMATH DE number 2079888

zbMATH Open1044.68755MaRDI QIDQ4472023FDOQ4472023

Authors: Susana C. Esquivel, Guillermo Leguizamón, Federico Zuppa, Raúl H. Gallard 

Publication date: 3 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2279/22790051.htm

Title of this publication is not available (Why is that?)

Recommendations

• Experimental comparison of heuristics for flow shop scheduling
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• A genetic algorithm for flow shop scheduling problems
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Comparison of heuristics for flowtime minimisation in permutation flowshops

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• A survey and evaluation of static flowshop scheduling heuristics
• Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
• Title not available (Why is that?)
• Experimental comparison of heuristics for flow shop scheduling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472023)