The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
type: Item
instance of: scholarly article
title: The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
zbMATH Open document ID: 1045.90031
DOI: 10.1016/S0377-2217(02)00645-8
author: D. Massart
published in: European Journal of Operational Research
publication date: 2003-10-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1992623
zbMATH Keywords: Genetic algorithms
zbMATH Keywords: Optimisation
zbMATH Keywords: Production scheduling
zbMATH Keywords: Complex products
describes a project that uses: TK
MaRDI profile type: Publication
cites work: A tabu search approach for the flow shop scheduling problem
cites work: Q4380372
cites work: A genetic algorithm for the job shop problem
cites work: Q4692508
cites work: A Branch-Bound Solution to the General Scheduling Problem
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Some new results on simulated annealing applied to the job shop scheduling problem
cites work: Job shop scheduling with a genetic algorithm and machine learning
cites work: Multiple and bicriteria scheduling: A literature survey
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Q4873656
cites work: Dispatching rules for scheduling in assembly jobshops - Part 1
description: scientific article; zbMATH DE number 1992623