Open shops with jobs overlap
type: Item
instance of: scholarly article
title: Open shops with jobs overlap
zbMATH Open document ID: 0797.90047
DOI: 10.1016/0377-2217(93)90347-P
published in: European Journal of Operational Research
publication date: 1994-10-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 550232
zbMATH Keywords: parallel processing
zbMATH Keywords: open shop
zbMATH Keywords: overlapping of jobs
zbMATH Keywords: permutation schedules
zbMATH Keywords: maximum completion time
zbMATH Keywords: maximum tardiness
zbMATH Keywords: sum of completion times
zbMATH Keywords: total tardiness
zbMATH Keywords: polynomial time algorithms
zbMATH Keywords: heuristic
author: Edouard Wagneur
author: Chelliah Sriskandarajah
MaRDI profile type: Publication
cites work: Q3821925
cites work: Q3938812
cites work: Q4198056
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: Q3339651
cites work: Q3940839
cites work: Q3221735
cites work: Global analysis and economics. III: Pareto Optima and price equilibria
cites work: On the complexity of preemptive openshop scheduling problems
full work available at URL: 0377-2217(93)90347-p
OpenAlex ID: W2092204527
description: scientific article; zbMATH DE number 550232