Tabu search for resource-constrained scheduling

DOI10.1016/S0377-2217(98)80001-5zbMath0991.90057OpenAlexW2051751101MaRDI QIDQ1609891

M. G. A. Verhoeven

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)80001-5

zbMATH Keywords

project schedulingtabu searchjob shop scheduling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing total weighted tardiness in a generalized job shop, Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, FMS scheduling based on timed Petri net model and reactive graph search, Scheduling and constraint propagation, Multiple machine JIT scheduling: a tabu search approach, Algorithmical approaches to business process design

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• 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
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
• A user's guide to tabu search
• Tabu Search—Part I
• A Fast Taboo Search Algorithm for the Job Shop Problem