Parallel machine scheduling with job assignment restrictions
From MaRDI portal
Publication:5433529
DOI10.1002/nav.20202zbMath1149.90058OpenAlexW2019300924MaRDI QIDQ5433529
Hans Kellerer, Celia A. Dr. Glass
Publication date: 9 January 2008
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20202
Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)
Related Items (36)
Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions ⋮ Online parallel machines scheduling with two hierarchies ⋮ On some special cases of the restricted assignment problem ⋮ Parallel machine scheduling with nested processing set restrictions ⋮ On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling ⋮ Multiprofessor scheduling ⋮ Smoothed performance guarantees for local search ⋮ An exact quadratic programming approach based on convex reformulation for seru scheduling problems ⋮ Strategyproof mechanism for two-sided matching with resource allocation ⋮ Fast approximation algorithms for job scheduling with processing set restrictions ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Scheduling uniform machines with restricted assignment ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ Optimal algorithms for semi-online machine covering on two hierarchical machines ⋮ Stable assignment with couples: parameterized complexity and local search ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Matching with sizes (or scheduling with processing set restrictions) ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Online scheduling of two job types on a set of multipurpose machines with unit processing times ⋮ Parallel machine scheduling with nested job assignment restrictions ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ A note on graph balancing problems with restrictions ⋮ Scheduling jobs with release and delivery times subject to nested eligibility constraints ⋮ Parallel machine scheduling with nested processing set restrictions and job delivery times ⋮ Algorithms for hierarchical and semi-partitioned parallel scheduling ⋮ Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION ⋮ Scheduling parallel machines with inclusive processing set restrictions and job release times
Cites Work
This page was built for publication: Parallel machine scheduling with job assignment restrictions
