MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS

DOI10.1142/S1793830909000129zbMath1178.90150OpenAlexW2165861840MaRDI QIDQ3397506

Yumei Huo, Bin Fu, Hairong Zhao

Publication date: 22 September 2009

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

Full work available at URL: https://doi.org/10.1142/s1793830909000129

zbMATH Keywords

PTASFPTASinapproximationmachine availability constraintsscheduling with fixed jobs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (1)

Approximation schemes for parallel machine scheduling with availability constraints

Cites Work

• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
• Approximation results for flow shop scheduling problems with machine availability constraints
• Non-preemptive two-machine open shop scheduling with non-availability constraints
• A PTAS for the multiple subset sum problem with different knapsack capacities
• The effect of machine availability on the worst-case performance of LPT
• Makespan minimization for two parallel machines with an availability constraint
• Approximability of scheduling with fixed jobs
• Scheduling with limited machine availability
• Parallel machine scheduling with machine availability and eligibility constraints
• Machine scheduling with an availability constraint
• Two-machine flow shops with limited machine availability

This page was built for publication: MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS