A repairing technique for the local search of the job-shop problem.

DOI10.1016/S0377-2217(02)00733-6zbMath1053.90042MaRDI QIDQ1417509

Boštjan Murovec, Peter Šuhel

Publication date: 5 January 2004

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

zbMATH Keywords

Scheduling; Local search; Job-shop; Neighborhood function

Mathematics Subject Classification ID

90B40: Search theory

90B35: Deterministic scheduling theory in operations research

Related Items

A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, An integrated tabu search algorithm for the lot streaming problem in job shops, A sequencing approach for creating new train timetables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The job shop scheduling problem: Conventional and new solution techniques
• A branch and bound algorithm for the job-shop scheduling problem
• Deterministic job-shop scheduling: Past, present and future
• A generalized permutation approach to job shop scheduling with genetic algorithms
• Effective neighbourhood functions for the flexible job shop problem
• Applying tabu search to the job-shop scheduling problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Job Shop Scheduling by Local Search