A note on parallel machine scheduling with non-simultaneous machine available time
From MaRDI portal
Publication:1962027
Recommendations
- Parallel machines scheduling with nonsimultaneous machine available time
- Parallel scheduling problem with non-simultaneous machine available times
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
- scientific article; zbMATH DE number 1234733
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
Cited in
(21)- Uniform machine scheduling with machine available constraints
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
- Scheduling jobs with maintenance subject to load-dependent duration on a single machine
- 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
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Makespan minimization for two parallel machines with an availability constraint
- Parallel machine scheduling with machine availability and eligibility constraints
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
- A note on the optimal makespan of a parallel machine scheduling problem
- A note on unrelated parallel machine scheduling with time-dependent processing times
- A note on unrelated parallel machine scheduling with time-dependent processing times
- Approximation algorithms for scheduling with reservations
- The LPT heuristic for minimizing total load on a proportionate openshop
- 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 with job rejection and nonsimultaneous machine available time on unrelated parallel machines
- Parallel machine scheduling with multiple unloading servers
This page was built for publication: A note on parallel machine scheduling with non-simultaneous machine available time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962027)
