Open shop scheduling with synchronization
type: Item
instance of: scholarly article
title: Open shop scheduling with synchronization
zbMATH Open document ID: 1386.90065
author: Peng Zhang
published in: Journal of Scheduling
publication date: 2018-02-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6845347
zbMATH Keywords: open shop
zbMATH Keywords: synchronization
zbMATH Keywords: complexity
Wikidata QID: Q59602545
MaRDI profile type: Publication
full work available at URL: s10951-016-0490-0
OpenAlex ID: W2529281151
cites work: A Monge property for the \(d\)-dimensional transportation problem
cites work: Scheduling a batching machine
cites work: Perspectives of Monge properties in optimization
cites work: On the complexity of decomposing matrices arising in satellite communication
cites work: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
cites work: On the recognition of permuted Supnick and incomplete Monge matrices
cites work: Q4414490
cites work: Synchronous Unpaced Flow Lines with Worker Differences and Overtime Cost
cites work: Weighted coloring: further complexity and approximability results
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: A general class of greedily solvable linear programs
cites work: Some new results in flow shop scheduling
cites work: Flow shop-sequencing problem with synchronous transfers and makespan minimization
cites work: Designing energy-efficient serial production lines: the unpaced synchronous line-balancing problem
cites work: Complexity results for flow shop problems with synchronous movement
cites work: The assignment problem with nearly Monge arrays and incompatible partner indices
DBLP publication ID: journals/scheduling/WeissWKS17
DOI: 10.1007/S10951-016-0490-0
description: scientific article; zbMATH DE number 6845347