Batch processing machine scheduling problems using a self-adaptive approach based on dynamic programming
From MaRDI portal
Cites work
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- A survey of scheduling with parallel batch (p-batch) processing
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Arc-flow approach for single batch-processing machine scheduling
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs
- Just-in-time scheduling for a distributed concrete precast flow shop system
- Just-in-time single-batch-processing machine scheduling
- Logic-based Benders decomposition for scheduling a batching machine
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Novel model and solution method for flexible job shop scheduling problem with batch processing machines
- Scheduling flow shops using differential evolution algorithm
- Scheduling with batching: A review
- Solving single batch-processing machine problems using an iterated heuristic
- Split-merge: using exponential neighborhood search for scheduling a batching machine
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
Cited in
(2)
This page was built for publication: Batch processing machine scheduling problems using a self-adaptive approach based on dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974972)
