Bounded serial-batching scheduling for minimizing maximum lateness and makespan
type: Item
instance of: scholarly article
title: Bounded serial-batching scheduling for minimizing maximum lateness and makespan
zbMATH Open document ID: 1387.90090
author: Cheng He
author: Hao Lin
author: Yanpei Liu
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6872050
zbMATH Keywords: bicriteria scheduling
zbMATH Keywords: serial-batching machine
zbMATH Keywords: bounded
zbMATH Keywords: makespan
zbMATH Keywords: maximum lateness
zbMATH Keywords: Pareto optimal solutions
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.02.001
OpenAlex ID: W2003983870
cites work: Multicriteria scheduling
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3070927
cites work: An improved algorithm for a bicriteria batching scheduling problem
cites work: A DP algorithm for minimizing makespan and total completion time on a series-batching machine
cites work: Q2734595
DOI: 10.1016/J.DISOPT.2015.02.001
description: scientific article; zbMATH DE number 6872050