Partially concurrent open shop scheduling with integral preemptions

DOI10.1007/S10479-017-2503-6zbMATH Open1380.90118OpenAlexW2611037226MaRDI QIDQ1698281FDOQ1698281

Authors: Hagai Ilani, Elad Shufan, 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

Recommendations

• The representation of partially-concurrent open shop problems
• Bounded colouring motivated by the limited resource partially concurrent open shop problem
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• Open shop scheduling with some additional constraints
• Restrictions and preassignments in preemptive open shop scheduling

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)

Cites Work

• Title not available (Why is that?)
• Normal hypergraphs and the perfect graph conjecture
• Title not available (Why is that?)
• Matching theory
• 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
• Title not available (Why is that?)
• Restricted coloring models for timetabling
• Minimizing the sum of weighted completion times in a concurrent open shop
• Solving the open shop scheduling problem
• Open shops with jobs overlap
• Coloring graph products---a survey
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Partially concurrent open shop scheduling with integral preemptions
• Title not available (Why is that?)
• Perfect product graphs
• The representation of partially-concurrent open shop problems
• Solving the minimum-weighted coloring problem
• Title not available (Why is that?)

Cited In (7)

• Bounded colouring motivated by the limited resource partially concurrent open shop problem
• Partially concurrent open shop scheduling with integral preemptions
• Restrictions and preassignments in preemptive open shop scheduling
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• The representation of partially-concurrent open shop problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698281)