Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
type: Item
instance of: scholarly article
title: Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
zbMATH Open document ID: 1391.90315
author: B. Shahidi-Zadeh
author: A. Taheri-Moghadam
author: I. Rastgar
author: R. Tavakkoli-Moghaddam
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6902761
zbMATH Keywords: production scheduling
zbMATH Keywords: unrelated parallel batch processors
zbMATH Keywords: \(\varepsilon\)-constraint method
zbMATH Keywords: multi-objective harmony search
zbMATH Keywords: sensitivity analysis
MaRDI profile type: Publication
full work available at URL: j.cor.2017.06.019
OpenAlex ID: W2726738415
cites work: Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
cites work: Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
cites work: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
cites work: A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
cites work: A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
cites work: Robust design for unconstrained optimization problems using the Taguchi method
cites work: Scheduling unrelated parallel batch processing machines with non-identical job sizes
cites work: Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
cites work: Scheduling unrelated parallel machines with sequence-dependent setups
cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
cites work: Q4198056
cites work: Scheduling
cites work: 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
cites work: Q5445111
cites work: A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
DOI: 10.1016/J.COR.2017.06.019
description: scientific article; zbMATH DE number 6902761