Open shop scheduling with machine dependent processing times
type: Item
instance of: scholarly article
title: Open shop scheduling with machine dependent processing times
zbMATH Open document ID: 0767.90035
DOI: 10.1016/0166-218X(92)90176-B
author: Moshe Dror
published in: Discrete Applied Mathematics
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 98500
zbMATH Keywords: machine dependent processing times
zbMATH Keywords: mean flow time
zbMATH Keywords: NP-hard
zbMATH Keywords: makespan
MaRDI profile type: Publication
cites work: Scheduling the Open Shop to Minimize Mean Flow Time
cites work: Open-shop scheduling problems with dominated machines
cites work: Openshop and flowshop scheduling to minimize sum of completion times
cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
description: scientific article; zbMATH DE number 98500