Investigating the use of genetic programming for a classic one-machine scheduling problem

DOI10.1016/S0965-9978(00)00109-5zbMath1003.68577OpenAlexW2072395453WikidataQ111899282 ScholiaQ111899282MaRDI QIDQ1852227

A. M. S. Zalzala, C. Dimopoulos

Publication date: 9 January 2003

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0965-9978(00)00109-5

zbMATH Keywords

schedulingtardinessevolutionary computationgenetic programmingmanufacturing optimisation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Computing methodologies and applications (68U99)

Related Items (5)

Consultation sequencing of a hospital with multiple service points using genetic programming ⋮ Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ Evolving knowledge for the solution of clustering problems in cellular manufacturing ⋮ Multi-objective optimization of manufacturing cell design

This page was built for publication: Investigating the use of genetic programming for a classic one-machine scheduling problem