Bicriterion scheduling with equal processing times on a batch processing machine
type: Item
instance of: scholarly article
title: Bicriterion scheduling with equal processing times on a batch processing machine
zbMATH Open document ID: 1163.90497
author: B. E. Eshmatov
published in: Computers \& Operations Research
publication date: 2008-10-08T00:00:00Z
full work available at URL: http://hdl.handle.net/10397/1302
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5349737
zbMATH Keywords: scheduling
zbMATH Keywords: bicriterion
zbMATH Keywords: batch processing machine
MaRDI profile type: Publication
OpenAlex ID: W2030642542
cites work: Q3425494
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Scheduling unit processing time jobs on a single machine with multiple criteria
cites work: Minimizing flowtime and missed due-dates in single-machine sequencing
cites work: Complexity of single machine, multi-criteria scheduling problems
cites work: Complexity of single machine hierarchical scheduling: A survey
cites work: Multiple and bicriteria scheduling: A literature survey
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Scheduling a batching machine
cites work: Batching identical jobs
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
DOI: 10.1016/J.COR.2007.07.007
description: scientific article; zbMATH DE number 5349737