Learning-augmented heuristics for scheduling parallel serial-batch processing machines
From MaRDI portal
(Redirected from Publication:6164322)
Recommendations
- Parallel machine scheduling with a learning effect
- Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
- Heuristics and augmented neural networks for task scheduling with non-identical machines
- Parallel machines scheduling with deteriorating and learning effects
- Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect
- Machine scheduling problems with a general learning effect
- scientific article; zbMATH DE number 6000948
- Learning in stochastic machine scheduling
Cites work
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- An iterative approach for the serial batching problem with parallel machines and job families
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- Cloud manufacturing -- scheduling as a service for sheet metal manufacturing
- Deep learning
- Discovering dispatching rules using data mining
- Discrete lotsizing and scheduling by batch sequencing
- Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
- Family scheduling with batch availability in flow shops to minimize makespan
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Handbook of metaheuristics
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Integration of inductive learning and neural networks for multi-objective FMS scheduling
- Learning effective dispatching rules for batch processor scheduling
- Makespan estimation in batch process industries: A comparison between regression analysis and neural networks
- Multi-target prediction: a unifying view on problems and methods
- Multi-target regression via input space expansion: treating targets as inputs
- Multi-target support vector regression via correlation regressor chains
- One-pass batching algorithms for the one-machine problem
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Scikit-learn: machine learning in Python
- Sequencing jobs on a single machine: A neural network approach
- Solving the serial batching problem in job shop manufacturing systems
Cited in
(9)- Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm
- Learning effective dispatching rules for batch processor scheduling
- A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking
- Nesting and scheduling optimization of additive manufacturing systems: mapping the territory
- Scheduling jobs using queries to interactively learn human availability times
- A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
- Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines
- Machine learning based algorithm selection and genetic algorithms for serial-batch scheduling
- Machine scheduling instance generation by reverse engineering from instance space analysis
This page was built for publication: Learning-augmented heuristics for scheduling parallel serial-batch processing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164322)
