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
type: Item
instance of: scholarly article
title: 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
zbMATH Open document ID: 1391.90316
author: Omid Shahvari
author: Rasaratnam Logendran
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901269
zbMATH Keywords: bi-criteria
zbMATH Keywords: batch scheduling
zbMATH Keywords: group scheduling
zbMATH Keywords: unrelated-parallel machines
zbMATH Keywords: tabu search
zbMATH Keywords: sequence- and machine-dependent setup time
describes a project that uses: CPLEX
describes a project that uses: Tabu search
describes a project that uses: DataFit
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.021
OpenAlex ID: W2479867382
cites work: A survey of scheduling problems with setup times or costs
cites work: Q5437769
cites work: Single Machine Group Scheduling with Two Ordered Criteria
cites work: Statistical Analysis of Computational Tests of Algorithms and Heuristics
cites work: New multi-objective method to solve reentrant hybrid flow shop scheduling problem
cites work: Iterated greedy local search methods for unrelated parallel machine scheduling
cites work: Group-scheduling problems in electronics manufacturing
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4354785
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimizing the number of tardy jobs for \(m\) parallel machines
cites work: Needed: An Empirical Science of Algorithms
cites work: Reducibility among Combinatorial Problems
cites work: Scheduling unrelated parallel machines to minimize total weighted tardiness.
cites work: An ant colony optimization metaheuristic for machine-part cell formation problems
cites work: Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
cites work: A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems
cites work: Scheduling unrelated parallel machines with sequence-dependent setups
cites work: Scheduling with batching: A review
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Group scheduling jobs on a single machine: A multi-objective approach with preemptive priority structure
cites work: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
cites work: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
cites work: Total flow time minimization in a flowshop sequence-dependent group scheduling problem
cites work: Scheduling a flowline manufacturing cell with sequence dependent family setup times
cites work: Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
cites work: Flow shop batching and scheduling with sequence-dependent setup times
cites work: Benchmarks for basic scheduling problems
cites work: New hard benchmark for flowshop scheduling problems minimising makespan
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Single-machine group scheduling problems with deteriorated and learning effect
cites work: Learning and forgetting effects on a group scheduling problem
DOI: 10.1016/J.COR.2016.07.021
description: scientific article; zbMATH DE number 6901269