A hybrid neural network approach to minimize total completion time on a single batch processing machine
From MaRDI portal
Publication:6092620
DOI10.1111/itor.12665OpenAlexW2938117714WikidataQ128045509 ScholiaQ128045509MaRDI QIDQ6092620
No author found.
Publication date: 23 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12665
Related Items (1)
Cites Work
- Unnamed Item
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- A neurogenetic approach for the resource-constrained project scheduling problem
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- ``Neural computation of decisions in optimization problems
- Augmented neural networks for task scheduling.
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Makespan minimization on single batch-processing machine via ant colony optimization
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Scheduling with batching: A review
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- Heuristics and augmented neural networks for task scheduling with non-identical machines
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- A neural network approach for batching decisions in wafer fabrication
- Scheduling a batch processing machine with non-identical job sizes
- Design and Analysis of Experiments, Second Edition
- Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Augmented neural networks and problem structure-based heuristics for the bin-packing problem
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: A hybrid neural network approach to minimize total completion time on a single batch processing machine
