Concurrent operations can be parallelized in scheduling multiprocessor job shop

DOI10.1002/JOS.101zbMATH Open1009.90043OpenAlexW2028128054MaRDI QIDQ1607976FDOQ1607976

Evgeny V. Shchepin, Nodari Vakhania

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

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

zbMATH Keywords

unrelated machinesmultiprocessor job shop schedulingsolution tree

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• The one-machine sequencing problem
• An Algorithm for Solving the Job-Shop Problem
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Extending the shifting bottleneck procedure to real-life applications
• Job-shop scheduling with multi-purpose machines
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• Job-Shop Scheduling by Implicit Enumeration
• Improved Approximation Algorithms for Shop Scheduling Problems
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Complexity of scheduling problems with multi-purpose machines
• Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
• Practical job shop scheduling

Cited In (2)

• Probabilistic quality estimations for combinatorial optimization problems
• Theoretical expectation versus practical performance of Jackson's heuristic

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)