scientific article; zbMATH DE number 890241

zbMath0863.90087MaRDI QIDQ4882527

Bernd Jurisch

Publication date: 17 June 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

flexible manufacturing systemsbranch-and-boundshop schedulingmulti-purpose machinesheuristc methods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Tabu-search for the multi-mode job-shop problem, A batch-oblivious approach for complex job-shop scheduling problems, A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem, Adaptive multimeme algorithm for flexible job shop scheduling problem, Job-shop scheduling with processing alternatives., Effective neighbourhood functions for the flexible job shop problem, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, Discrepancy search for the flexible job shop scheduling problem, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, Tabu search for the job-shop scheduling problem with multi-purpose machines