Job shop scheduling with unit time operations under resource constraints and release dates
type: Item
instance of: scholarly article
title: Job shop scheduling with unit time operations under resource constraints and release dates
zbMATH Open document ID: 0636.90046
DOI: 10.1016/0166-218X(87)90023-0
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4037588
zbMATH Keywords: job shop scheduling
zbMATH Keywords: minimum length
zbMATH Keywords: sum of completion times
zbMATH Keywords: polynomial time
author: Jayme L. Szwarcfiter
MaRDI profile type: Publication
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Some new results in flow shop scheduling
description: scientific article; zbMATH DE number 4037588