A note on parallel machine scheduling with non-simultaneous machine available time

DOI10.1016/S0166-218X(99)00201-2MaRDI QIDQ1962027zbMATHOpenAlexFDO

Authors Chung-Yee Lee, Yong He, Guochun Tang

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

zbMATH Keywords

parallel machine schedulingmachine availability constrainterror-bound analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• Parallel machines scheduling with nonsimultaneous machine available time

Cited in

(21)

• Uniform machine scheduling with machine available constraints
• Scheduling jobs with maintenance subject to load-dependent duration on a single machine
• Approximation algorithms for scheduling with reservations
• 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
• A note on unrelated parallel machine scheduling with time-dependent processing times
• Optimal parallel machines scheduling with availability constraints
• Parallel machine scheduling with machine availability and eligibility constraints
• A note on unrelated parallel machine scheduling with time-dependent processing times
• Makespan minimization for two parallel machines with an availability constraint
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
• Parallel machine scheduling with multiple unloading servers
• Optimal scheduling of a two-stage hybrid flow shop
• The LPT heuristic for minimizing total load on a proportionate openshop
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• A note on the optimal makespan of a parallel machine scheduling problem
• Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints

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)