scientific article; zbMATH DE number 805284
From MaRDI portal
Publication:4851825
zbMath0841.90079MaRDI QIDQ4851825
Publication date: 12 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
genetic algorithmslocal searchjob shop schedulingprecedence constraintstaboo searchsimultaneous cooperation of several machines
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Insertion techniques for static and dynamic resource-constrained project scheduling. ⋮ A repairing technique for the local search of the job-shop problem. ⋮ Effective neighbourhood functions for the flexible job shop problem ⋮ Mixed multigraph approach to scheduling jobs on machines of different types∗ ⋮ A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The resource-constrained activity insertion problem with minimum and maximum time lags
This page was built for publication:
