The complexity of two group scheduling problems
type: Item
instance of: scholarly article
title: The complexity of two group scheduling problems
zbMATH Open document ID: 1058.90022
author: M. Y. Kovalyov
author: Jacek Blazewicz
published in: Journal of Scheduling
publication date: 2003-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1872734
zbMATH Keywords: scheduling
zbMATH Keywords: group technology
zbMATH Keywords: parallel machines
zbMATH Keywords: open shop
Wikidata QID: Q57387829
MaRDI profile type: Publication
full work available at URL: jos.118
OpenAlex ID: W2006725417
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: Scheduling with batching: A review
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Minimizing the number of late jobs under the group technology assumption
cites work: Parallel Machine Scheduling with Batch Setup Times
cites work: The complexity of scheduling job families about a common due date
cites work: Two-machine shop scheduling problems with batch processing
DOI: 10.1002/JOS.118
description: scientific article; zbMATH DE number 1872734