Partially concurrent open shop scheduling with integral preemptions

DOI10.1007/s10479-017-2503-6zbMath1380.90118OpenAlexW2611037226MaRDI QIDQ1698281

Elad Shufan, Hagai Ilani, Tal Grinshpoun

Publication date: 15 February 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2503-6

zbMATH Keywords

graph colouringopen shop schedulingintegral preemptionintegral processing timespcosstechnician timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Partially concurrent open shop scheduling with integral preemptions ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Bounded colouring motivated by the limited resource partially concurrent open shop problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the sum of weighted completion times in a concurrent open shop
• Perfect product graphs
• Open shops with jobs overlap
• Restricted coloring models for timetabling
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Partially concurrent open shop scheduling with integral preemptions
• Coloring graph products---a survey
• The representation of partially-concurrent open shop problems
• Normal hypergraphs and the perfect graph conjecture
• Solving the minimum-weighted coloring problem
• Graphs with Given Group and Given Graph-Theoretical Properties
• Open Shop Scheduling to Minimize Finish Time
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Solving the open shop scheduling problem

This page was built for publication: Partially concurrent open shop scheduling with integral preemptions