On the complexity of bi-criteria scheduling on a single batch processing machine
type: Item
instance of: scholarly article
title: On the complexity of bi-criteria scheduling on a single batch processing machine
zbMATH Open document ID: 1208.90073
author: Juan-Miguel Gracia
published in: Journal of Scheduling
publication date: 2011-04-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5873389
zbMATH Keywords: scheduling
zbMATH Keywords: batch processing
zbMATH Keywords: bi-criteria
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s10951-010-0180-2
OpenAlex ID: W2034359812
cites work: Scheduling a batching machine
cites work: Minimizing total completion time on a batch processing machine with job families
cites work: Complexity of single machine, multi-criteria scheduling problems
cites work: Minimizing number of tardy jobs on a batch processing machine with incompatible job families
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: Complexity of single machine hierarchical scheduling: A survey
cites work: On scheduling an unbounded batch machine
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Multiple and bicriteria scheduling: A literature survey
cites work: Minimizing total weighted tardiness on a single batch process machine with incompatible job families
cites work: Scheduling batch processing machines with incompatible job families
DOI: 10.1007/S10951-010-0180-2
description: scientific article; zbMATH DE number 5873389