Scheduling parallel machines with inclusive processing set restrictions
From MaRDI portal
Publication:3518727
DOI10.1002/nav.20286zbMath1153.90432OpenAlexW2072712212MaRDI QIDQ3518727
Jinwen Ou, Chung-Lun Li, Joseph Y.-T. Leung
Publication date: 11 August 2008
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20286
Related Items (40)
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions ⋮ Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ Multiple subset sum with inclusive assignment set restrictions ⋮ Parallel machine scheduling with nested processing set restrictions ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling ⋮ Smoothed performance guarantees for local search ⋮ Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ An exact quadratic programming approach based on convex reformulation for seru scheduling problems ⋮ 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 ⋮ Berth allocation with time-dependent physical limitations on vessels ⋮ Scheduling uniform machines with restricted assignment ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ Structural parameters for scheduling with assignment restrictions ⋮ A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions ⋮ Performance guarantees of jump neighborhoods on restricted related parallel machines ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 ⋮ TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Fast approximation algorithms for uniform machine scheduling with processing set restrictions ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling of two job types on a set of multipurpose machines with unit processing times ⋮ Online scheduling with equal processing times and machine eligibility constraints ⋮ A comment on parallel-machine scheduling under a grade of service provision to minimize makespan ⋮ 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 ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Scheduling of a single crane in batch annealing process ⋮ POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels ⋮ 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: Scheduling parallel machines with inclusive processing set restrictions
