Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling
From MaRDI portal
Publication:5426585
DOI10.1080/00207540600806505zbMath1126.90342OpenAlexW2029465702MaRDI QIDQ5426585
No author found.
Publication date: 13 November 2007
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600806505
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- 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
- Operations planning for a multi-stage kanban system
- Applying tabu search to the job-shop scheduling problem
- A Model for Continuous-Review Pull Policies in Serial Inventory Systems
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Reacting JIT ordering systems to the unstable changes in demand
- A branch-and-bound-based local search method for the flow shop problem
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- An adaptive approach to controlling kanban systems
This page was built for publication: Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling
