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
From MaRDI portal
(Redirected from Publication:1652033)
Recommendations
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Scheduling unrelated parallel machines with sequence-dependent setups
- Bounded parallel-batch scheduling on unrelated parallel machines
Cites work
- A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
- A survey of scheduling problems with setup times or costs
- A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
- An ant colony optimization metaheuristic for machine-part cell formation problems
- 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 iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Benchmarks for basic scheduling problems
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Flow shop batching and scheduling with sequence-dependent setup times
- Future paths for integer programming and links to artificial intelligence
- Group scheduling jobs on a single machine: A multi-objective approach with preemptive priority structure
- Group-scheduling problems in electronics manufacturing
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Learning and forgetting effects on a group scheduling problem
- Minimizing the number of tardy jobs for m parallel machines
- Needed: An Empirical Science of Algorithms
- New hard benchmark for flowshop scheduling problems minimising makespan
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Reducibility among combinatorial problems
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Scheduling Groups of Jobs on a Single Machine
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Scheduling unrelated parallel machines with sequence-dependent setups
- Scheduling with batching: A review
- Single Machine Group Scheduling with Two Ordered Criteria
- Single-machine group scheduling problems with deteriorated and learning effect
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- Total flow time minimization in a flowshop sequence-dependent group scheduling problem
Cited in
(13)- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
- 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 efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm
- A new model and algorithm for uncertain random parallel machine scheduling problem
- Just-in-time scheduling for a distributed concrete precast flow shop system
- Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Learning-augmented heuristics for scheduling parallel serial-batch processing machines
- Deep reinforcement learning for workpieces heat treatment batch scheduling considering compatibility-dependent setup times
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652033)
