Scheduling parallel machines with inclusive processing set restrictions
From MaRDI portal
Publication:3518727
DOI10.1002/nav.20286zbMath1153.90432MaRDI QIDQ3518727
Joseph Y.-T. Leung, Jinwen Ou, Chung-Lun Li
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
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, 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, Online scheduling of two job types on a set of multipurpose machines with unit processing times, Parallel machine scheduling with nested job assignment restrictions, 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
