POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION

DOI10.1142/S1793830909000282zbMath1175.90175MaRDI QIDQ3646206

Jianping Li, Weidong Li, Jianbo Li

Publication date: 19 November 2009

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

schedulingallocationgrade of servicepolynomial time approximation schemefully polynomial time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 ⋮ Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for scheduling on parallel machines
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Parallel machine scheduling under a grade of service provision
• Integer Programming with a Fixed Number of Variables
• Scheduling parallel machines with inclusive processing set restrictions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION