Job-shop scheduling with processing alternatives.

DOI10.1016/S0377-2217(02)00828-7zbMath1052.90033MaRDI QIDQ1410614

Tamás Kis

Publication date: 14 October 2003

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

zbMATH Keywords

Genetic algorithms; Tabu search; Scheduling; Job-shop; Insertion techniques; Open-shop

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B35: Deterministic scheduling theory in operations research

Related Items

An agent-based negotiation approach to integrate process planning and scheduling, A tabu search approach for scheduling hazmat shipments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The mixed shop scheduling problem
• Job-shop scheduling with multi-purpose machines
• Multi-resource shop scheduling with resource flexibility
• Constructive heuristic algorithms for the open shop problem
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• A branch \(\&\) bound algorithm for the open-shop problem
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Tabu-search for the multi-mode job-shop problem
• Insertion techniques for the heuristic solution of the job shop problem
• Complexity of mixed shop scheduling problems: A survey
• Effective neighbourhood functions for the flexible job shop problem
• Benchmarks for basic scheduling problems
• Routing and scheduling in a flexible job shop by tabu search
• Applying tabu search to the job-shop scheduling problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• Computational Complexity of Discrete Optimization Problems