Shop scheduling problems with multiprocessor tasks on dedicated processors

DOI10.1007/BF02099688MaRDI QIDQ1897372zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

NP-hard problemsshop schedulingmakespan minimizationmultiprocessor tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• scientific article; zbMATH DE number 3860868
• Scheduling multiprocessor tasks on three dedicated processors
• On the complexity of preemptive open-shop scheduling problems
• On the complexity of multiprocessor task scheduling

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• An efficient algorithm for a job shop problem
• An efficient algorithm for the job-shop problem with two jobs
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Integer Programming with a Fixed Number of Variables
• Multiprocessor scheduling with communication delays
• NP-hardness of shop-scheduling problems with three jobs
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Open Shop Scheduling to Minimize Finish Time
• Open shop problems with unit time operations
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Scheduling multiprocessor tasks on three dedicated processors
• `` Strong NP-Completeness Results

Cited in

(16)

• Scheduling multiprocessor tasks -- An overview
• Feasible job insertions in the multi-processor-task job shop
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
• Surgical case scheduling as a generalized job shop scheduling problem
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
• scientific article; zbMATH DE number 1416512 (Why is no real title available?)
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• scientific article; zbMATH DE number 776077 (Why is no real title available?)
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
• Feasible insertions in job shop scheduling, short cycles and stable sets
• Scheduling multiprocessor tasks on two parallel processors
• Concurrent operations can be parallelized in scheduling multiprocessor job shop
• Tabu-search for the multi-mode job-shop problem
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times

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)