A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS

DOI10.1142/S0217595904000084zbMath1056.90067MaRDI QIDQ4650621

Hark-Chin Hwang, Soo Y. Chang, Yushin Hong

Publication date: 18 February 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

competitive ratio; machine eligibility; On-line parallel machine scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, Coordination mechanisms with hybrid local policies, Scheduling unit length jobs on parallel machines with lookahead information, Improved bounds for online scheduling with eligibility constraints, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, Online scheduling of two job types on a set of multipurpose machines with unit processing times, On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints, An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times, A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions

Cites Work

• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• The optimal on-line parallel machine scheduling
• The Competitiveness of On-Line Assignments
• Bounds for Certain Multiprocessing Anomalies