Concurrent operations can be parallelized in scheduling multiprocessor job shop
From MaRDI portal
(Redirected from Publication:1607976)
Recommendations
- Shared processor scheduling of multiprocessor jobs
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- scientific article; zbMATH DE number 871911
- The consecutive multiprocessor job scheduling problem
- Simultaneous job scheduling and resource allocation on parallel machines
- scientific article; zbMATH DE number 838793
- Scheduling multiprocessor tasks on two parallel processors
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Assembly-line scheduling with concurrent operations and parallel machines
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Algorithm for Solving the Job-Shop Problem
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Complexity of scheduling problems with multi-purpose machines
- Extending the shifting bottleneck procedure to real-life applications
- Improved Approximation Algorithms for Shop Scheduling Problems
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Job-Shop Scheduling by Implicit Enumeration
- Job-shop scheduling with multi-purpose machines
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Practical job shop scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The one-machine sequencing problem
Cited in
(2)
This page was built for publication: Concurrent operations can be parallelized in scheduling multiprocessor job shop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607976)
