Partially concurrent open shop scheduling with integral preemptions

DOI10.1007/S10479-017-2503-6MaRDI QIDQ1698281zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 894720 (Why is no real title available?)
• scientific article; zbMATH DE number 3333906 (Why is no real title available?)
• scientific article; zbMATH DE number 3078983 (Why is no real title available?)
• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Coloring graph products---a survey
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Graphs with Given Group and Given Graph-Theoretical Properties
• Matching theory
• Minimizing the sum of weighted completion times in a concurrent open shop
• Normal hypergraphs and the perfect graph conjecture
• Open Shop Scheduling to Minimize Finish Time
• Open shops with jobs overlap
• Partially concurrent open shop scheduling with integral preemptions
• Perfect product graphs
• Restricted coloring models for timetabling
• Solving the minimum-weighted coloring problem
• Solving the open shop scheduling problem
• The representation of partially-concurrent open shop problems

Cited in

(7)

• The representation of partially-concurrent open shop problems
• 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

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)