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
Publication:1652033
DOI10.1016/j.cor.2016.07.021zbMath1391.90316OpenAlexW2479867382MaRDI QIDQ1652033
Rasaratnam Logendran, Omid Shahvari
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.021
tabu searchgroup schedulingbatch schedulingbi-criteriasequence- and machine-dependent setup timeunrelated-parallel machines
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
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 ⋮ 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 ⋮ 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 ⋮ 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 ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Flow shop batching and scheduling with sequence-dependent setup times
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Total flow time minimization in a flowshop sequence-dependent group scheduling problem
- Scheduling unrelated parallel machines with sequence-dependent setups
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Group-scheduling problems in electronics manufacturing
- Single-machine group scheduling problems with deteriorated and learning effect
- An ant colony optimization metaheuristic for machine-part cell formation problems
- Iterated greedy local search methods for unrelated parallel machine scheduling
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- Minimizing the number of tardy jobs for \(m\) parallel machines
- Group scheduling jobs on a single machine: A multi-objective approach with preemptive priority structure
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- 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
- Future paths for integer programming and links to artificial intelligence
- Scheduling with batching: A review
- Benchmarks for basic scheduling problems
- A survey of scheduling problems with setup times or costs
- Learning and forgetting effects on a group scheduling problem
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Needed: An Empirical Science of Algorithms
- A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- Single Machine Group Scheduling with Two Ordered Criteria
- Scheduling Groups of Jobs on a Single Machine
- Reducibility among Combinatorial Problems
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
