Parallel machine scheduling under a grade of service provision
type: Item
instance of: scholarly article
title: Parallel machine scheduling under a grade of service provision
zbMATH Open document ID: 1074.68529
DOI: 10.1016/S0305-0548(03)00164-3
author: Soo Y. Chang
author: Kangbok Lee
author: Hark-Chin Hwang
published in: Computers \& Operations Research
publication date: 2004-09-23T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2102607
zbMATH Keywords: longest processing time first algorithm
MaRDI profile type: Publication
cites work: Q3525910
cites work: Q4198056
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: On the exact upper bound for the Multifit processor scheduling algorithm
cites work: The Competitiveness of On-Line Assignments
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Parallel machines scheduling with nonsimultaneous machine available time
Recommended article: TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
Recommended article: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
Recommended article: Q3610745
Recommended article: Q5282528
Recommended article: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
Recommended article: Parallel machine scheduling with machine availability and eligibility constraints
Recommended article: Optimal parallel machines scheduling with availability constraints
Recommended article: Q4252432
Recommended article: Online scheduling on two parallel identical machines under a grade of service provision
Recommended article: Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
description: scientific article; zbMATH DE number 2102607