Scheduling parallel machines with inclusive processing set restrictions

DOI10.1002/nav.20286zbMath1153.90432MaRDI 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

zbMATH Keywords

scheduling; parallel machines; worst-case analysis; polynomial time approximation scheme

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION, Multiple subset sum with inclusive assignment set restrictions, Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, Semi-online scheduling with two GoS levels and unit processing time, Smoothed performance guarantees for local search, Fast approximation algorithms for job scheduling with processing set restrictions, Berth allocation with time-dependent physical limitations on vessels, Performance guarantees of jump neighborhoods on restricted related parallel machines, Scheduling jobs with equal processing times subject to machine eligibility constraints, Scheduling unit length jobs on parallel machines with lookahead information, Improved bounds for online scheduling with eligibility constraints, A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions, Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling, A comment on parallel-machine scheduling under a grade of service provision to minimize makespan, A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs, A note on graph balancing problems with restrictions, Scheduling of a single crane in batch annealing process, Scheduling parallel machines with inclusive processing set restrictions and job release times, Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities, 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, Online scheduling of two job types on a set of multipurpose machines with unit processing times, Multipurpose machine scheduling with rejection and identical job processing times, Structural parameters for scheduling with assignment restrictions, Online scheduling with equal processing times and machine eligibility constraints, Parallel machine scheduling with nested job assignment restrictions, Heuristics for online scheduling on identical parallel machines with two GoS levels, Parallel batch scheduling with nested processing set restrictions, Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times, Parallel machine scheduling with nested processing set restrictions, POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION, PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION

Cites Work

• Unnamed Item
• Unnamed Item