Minimizing the total completion time in a unit-time open shop with release times
type: Item
instance of: scholarly article
title: Minimizing the total completion time in a unit-time open shop with release times
zbMATH Open document ID: 0885.90062
DOI: 10.1016/S0167-6377(97)00015-1
author: Thomas Tautenhahn
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 1997-08-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1044006
zbMATH Keywords: total completion time
zbMATH Keywords: unit-time open shop
zbMATH Keywords: release times
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
cites work: Q3277097
cites work: Open shop problems with unit time operations
cites work: Scheduling unit time open shops to minimize the weighted number of late jobs
cites work: On Edge Coloring Bipartite Graphs
cites work: A preemptive open shop scheduling problem with one resource
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Note: Open-shop scheduling with release dates to minimize maximum lateness
cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
cites work: Scheduling Unit-Time Open Shops with Deadlines
cites work: Q4882996
Wikidata QID: Q127633500
full work available at URL: s0167-6377(97)00015-1
OpenAlex ID: W2076906849
description: scientific article; zbMATH DE number 1044006