Scheduling unit time open shops to minimize the weighted number of late jobs
type: Item
instance of: scholarly article
title: Scheduling unit time open shops to minimize the weighted number of late jobs
zbMATH Open document ID: 0793.90028
DOI: 10.1016/0167-6377(93)90088-X
author: Peter Brucker
author: Bernd Jurisch
author: Thomas Tautenhahn
author: Frank Werner
published in: Operations Research Letters
publication date: 1994-04-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 540811
zbMATH Keywords: unit processing times
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: open shop
zbMATH Keywords: fixed number of machines
zbMATH Keywords: weighted number of late jobs
MaRDI profile type: Publication
cites work: Open shop problems with unit time operations
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: A Note On The Complexity Of Openshop Scheduling Problems
cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
full work available at URL: 0167-6377(93)90088-x
OpenAlex ID: W1978964060
description: scientific article; zbMATH DE number 540811