Open shop scheduling with synchronization

DOI10.1007/s10951-016-0490-0zbMath1386.90065DBLPjournals/scheduling/WeissWKS17OpenAlexW2529281151WikidataQ59602545 ScholiaQ59602545MaRDI QIDQ1702656

Peng Zhang

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0490-0

zbMATH Keywords

complexitysynchronizationopen shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Flow shop scheduling with flexible processing times ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Synchronous flow shop scheduling with pliable jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Designing energy-efficient serial production lines: the unpaced synchronous line-balancing problem
• The assignment problem with nearly Monge arrays and incompatible partner indices
• Complexity results for flow shop problems with synchronous movement
• Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
• Weighted coloring: further complexity and approximability results
• On the complexity of decomposing matrices arising in satellite communication
• Scheduling a batching machine
• A Monge property for the \(d\)-dimensional transportation problem
• Perspectives of Monge properties in optimization
• On the recognition of permuted Supnick and incomplete Monge matrices
• A General Class of Greedily Solvable Linear Programs
• Synchronous Unpaced Flow Lines with Worker Differences and Overtime Cost
• Some new results in flow shop scheduling
• Open Shop Scheduling to Minimize Finish Time
• Flow shop-sequencing problem with synchronous transfers and makespan minimization

This page was built for publication: Open shop scheduling with synchronization