Bi-objective scheduling on a restricted batching machine
type: Item
instance of: scholarly article
title: Bi-objective scheduling on a restricted batching machine
zbMATH Open document ID: 1458.90269
author: Marta Cabo
author: José Luis González-Velarde
author: Edgar Possani
author: Y. A. Rios-Solis
published in: Computers \& Operations Research
publication date: 2018-09-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6938902
zbMATH Keywords: scheduling
zbMATH Keywords: batching machine
zbMATH Keywords: integer linear programming
zbMATH Keywords: BRKGA
MaRDI profile type: Publication
full work available at URL: j.cor.2018.07.004
OpenAlex ID: W2881427397
cites work: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
cites work: Scheduling a batching machine
cites work: Split-merge: using exponential neighborhood search for scheduling a batching machine
cites work: A biased random key genetic algorithm for the field Technician scheduling problem
cites work: Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
cites work: Bi-criteria scheduling on a single parallel-batch machine
cites work: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
cites work: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Bounded serial-batching scheduling for minimizing maximum lateness and makespan
cites work: Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
cites work: Multicriteria scheduling
cites work: Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
cites work: Randomized heuristics for the family traveling salesperson problem
cites work: A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
cites work: Optimal methods for batch processing problem with makespan and maximum lateness objectives
cites work: Q4254875
Wikidata QID: Q129642722
DOI: 10.1016/J.COR.2018.07.004
description: scientific article; zbMATH DE number 6938902