Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs
From MaRDI portal
Publication:5953158
DOI10.1016/S0305-0548(00)00011-3zbMath1017.90047OpenAlexW2038242369MaRDI 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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
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
This page was built for publication: Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs
