A note on parallel machine scheduling with non-simultaneous machine available time
From MaRDI portal
Publication:1962027
DOI10.1016/S0166-218X(99)00201-2zbMath0947.90047OpenAlexW1991593924MaRDI QIDQ1962027
Chung-Yee Lee, Guochun Tang, Yong He
Publication date: 8 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00201-2
Related Items
Makespan minimization for two parallel machines with an availability constraint ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines ⋮ Scheduling identical parallel machines with tooling constraints ⋮ The effect of machine availability on the worst-case performance of LPT ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ Parallel machine scheduling with multiple unloading servers ⋮ Optimal online algorithms for scheduling on two identical machines under a grade of service ⋮ Approximation algorithms for scheduling with reservations ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ Uniform machine scheduling with machine available constraints ⋮ Optimal online algorithm for scheduling on two identical machines with machine availability constraints. ⋮ Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
Cites Work
