The representation of partially-concurrent open shop problems
From MaRDI portal
Publication:2398435
DOI10.1007/s10479-015-1934-1zbMath1368.90070OpenAlexW2135659804MaRDI QIDQ2398435
Tal Grinshpoun, Elad Shufan, Hagai Ilani
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
reducibilitymatrix representationopen shop schedulinggraph orientationtechnician timetablingconcurrent machines
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
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
- Generating all the acyclic orientations of an undirected graph
- Minimizing the sum of weighted completion times in a concurrent open shop
- A contribution and new heuristics for open shop scheduling
- Order scheduling in an environment with dedicated resources in parallel
- A note on the complexity of the concurrent open shop problem
- Constructive heuristic algorithms for the open shop problem
- Open shops with jobs overlap
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
- Measuring instance difficulty for combinatorial optimization problems
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints
- On the set of solutions of the open shop problem
- Benchmarks for basic scheduling problems
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
- Scheduling
This page was built for publication: The representation of partially-concurrent open shop problems
