Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs

DOI10.1016/S0305-0548(00)00011-3zbMath1017.90047MaRDI QIDQ5953158

No author found.

Publication date: 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00011-3

zbMATH Keywords

simulated annealing; tabu search; genetic algorithm; neighborhood search

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A controlled search simulated annealing method for the single machine weighted tardiness problem
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• Applying tabu search to the job-shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Tabu Search—Part I
• Tabu Search—Part II
• Optimal Cycle Times in Multistage Serial Systems with Set-Up and Inventory Costs
• An Evaluation of Flow Shop Sequencing Heuristics
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Equation of State Calculations by Fast Computing Machines
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem