The representation of partially-concurrent open shop problems

DOI10.1007/S10479-015-1934-1MaRDI QIDQ2398435zbMATH OpenOpenAlexFDO

Authors Tal Grinshpoun, Hagai Ilani, Elad Shufan

Publication date 16 August 2017

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

Full work available at URL https://doi.org/10.1007/s10479-015-1934-1

zbMATH Keywords

concurrent machinesgraph orientationmatrix representationopen shop schedulingreducibilitytechnician timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Partially concurrent open shop scheduling with integral preemptions
• Open shop scheduling problems with conflict graphs
• Open shop scheduling with some additional constraints
• Bounded colouring motivated by the limited resource partially concurrent open shop problem
• A note on the complexity of the concurrent open shop problem

Cites work

• A contribution and new heuristics for open shop scheduling
• A note on the complexity of the concurrent open shop problem
• A polynomial algorithm for an open shop problem with unit processing times and tree constraints
• Benchmarks for basic scheduling problems
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Constructive heuristic algorithms for the open shop problem
• Generating all the acyclic orientations of an undirected graph
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 894720 (Why is no real title available?)
• Isomorphism for digraphs and sequences of shop scheduling problems
• Measuring instance difficulty for combinatorial optimization problems
• Minimizing the sum of weighted completion times in a concurrent open shop
• New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
• On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
• On the set of solutions of the open shop problem
• Open shops with jobs overlap
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling. Theory, algorithms, and systems.
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

Cited in

(5)

• 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
• Open shop scheduling problems with conflict graphs
• An efficient polynomial-time approximation scheme for parallel multi-stage open shops

This page was built for publication: The representation of partially-concurrent open shop problems

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