Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
type: Item
instance of: scholarly article
title: Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
zbMATH Open document ID: 0426.68013
DOI: 10.1016/0020-0190(79)90076-0
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 3664347
zbMATH Keywords: open shop
zbMATH Keywords: resource allocation
zbMATH Keywords: preemptive scheduling
zbMATH Keywords: renewable and non- renewable resources
author: Roman Słowiński
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90076-0
OpenAlex ID: W2024382178
cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3896829
description: scientific article; zbMATH DE number 3664347