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

From MaRDI portal
Revision as of 16:36, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (18)

Makespan minimization for two parallel machines with an availability constraintParallel machine scheduling with machine availability and eligibility constraintsOptimal scheduling of a two-stage hybrid flow shopScheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraintsScheduling jobs with maintenance subject to load-dependent duration on a single machineThe LPT heuristic for minimizing total load on a proportionate openshopScheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machinesScheduling identical parallel machines with tooling constraintsThe effect of machine availability on the worst-case performance of LPTOptimal parallel machines scheduling with availability constraintsScheduling jobs with service level requirements on parallel machines under availability and eligibility constraintsParallel machine scheduling with multiple unloading serversOptimal online algorithms for scheduling on two identical machines under a grade of serviceApproximation algorithms for scheduling with reservationsA Survey on Approximation Algorithms for Scheduling with Machine UnavailabilityUniform machine scheduling with machine available constraintsOptimal 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


This page was built for publication: A note on parallel machine scheduling with non-simultaneous machine available time