Shop scheduling problems with multiprocessor tasks on dedicated processors
From MaRDI portal
Publication:1897372
DOI10.1007/BF02099688zbMATH Open0831.90071OpenAlexW2076508578MaRDI QIDQ1897372FDOQ1897372
Authors: Peter Brucker, Andreas Krämer 
Publication date: 27 August 1995
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02099688
Recommendations
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal two- and three-stage production schedules with set-up time included
- Integer Programming with a Fixed Number of Variables
- NP-hardness of shop-scheduling problems with three jobs
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Open Shop Scheduling to Minimize Finish Time
- `` Strong NP-Completeness Results
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- Multiprocessor scheduling with communication delays
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- An efficient algorithm for the job-shop problem with two jobs
- Open shop problems with unit time operations
- Scheduling multiprocessor tasks on three dedicated processors
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- An efficient algorithm for a job shop problem
Cited In (16)
- Scheduling multiprocessor tasks on two parallel processors
- Concurrent operations can be parallelized in scheduling multiprocessor job shop
- Title not available (Why is that?)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Feasible insertions in job shop scheduling, short cycles and stable sets
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
- Tabu-search for the multi-mode job-shop problem
- Scheduling multiprocessor tasks -- An overview
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Feasible job insertions in the multi-processor-task job shop
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- Surgical case scheduling as a generalized job shop scheduling problem
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
- Title not available (Why is that?)
This page was built for publication: Shop scheduling problems with multiprocessor tasks on dedicated processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897372)
