Concurrent operations can be parallelized in scheduling multiprocessor job shop
From MaRDI portal
Publication:1607976
DOI10.1002/jos.101zbMath1009.90043OpenAlexW2028128054MaRDI QIDQ1607976
Nodari Vakhania, Evgeny V. Shchepin
Publication date: 8 August 2002
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.101
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Theoretical expectation versus practical performance of Jackson's heuristic, Probabilistic quality estimations for combinatorial optimization problems
Cites Work
- The one-machine sequencing problem
- Job-shop scheduling with multi-purpose machines
- Extending the shifting bottleneck procedure to real-life applications
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Practical job shop scheduling
- Complexity of scheduling problems with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Job-Shop Scheduling by Implicit Enumeration
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Improved Approximation Algorithms for Shop Scheduling Problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
