Tabu-search for the multi-mode job-shop problem

DOI10.1007/BF01545525zbMath0897.90122OpenAlexW2030389264MaRDI QIDQ1384220

Jürgen Neyer, Peter Brucker

Publication date: 1 July 1998

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01545525

zbMATH Keywords

makespantabu-searchmulti-mode job-shopmulti-processor-tasks job-shopmulti-purpose-machine job-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Feasible insertions in job shop scheduling, short cycles and stable sets, A tabu search approach for scheduling hazmat shipments, Optimization of the integrated problem of employee timetabling and job shop scheduling, Insertion techniques for static and dynamic resource-constrained project scheduling., Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times, Job-shop scheduling with processing alternatives., Effective neighbourhood functions for the flexible job shop problem, Surgical case scheduling as a generalized job shop scheduling problem, Feasible job insertions in the multi-processor-task job shop, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, A lower bound for the job insertion problem., The resource-constrained activity insertion problem with minimum and maximum time lags

Cites Work

• Job-shop scheduling with multi-purpose machines
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Unnamed Item
• Unnamed Item