Scheduling Independent Tasks with Deadlines on Semi-identical Processors
From MaRDI portal
Publication:3806974
DOI10.1057/jors.1988.44zbMath0657.90051MaRDI QIDQ3806974
Publication date: 1988
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1988.44
90B35: Deterministic scheduling theory in operations research
Related Items
Unnamed Item, Scheduling jobs in open shops with limited machine availability, Scheduling with unexpected machine breakdowns, Two-machine flow shops with limited machine availability, Single-machine scheduling with maintenance and repair rate-modifying activities, Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, Minimizing the sum of job completion times on capacitated two-parallel machines, Two-machine flowshop scheduling with availability constraints, A new tabu search procedure for an audit-scheduling problem, Nearly on line scheduling of preemptive independent tasks, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Machine scheduling with a rate-modifying activity, Preemptive scheduling with variable profile, precedence constraints and due dates, Makespan minimization for two parallel machines with an availability constraint, Scheduling with limited machine availability, Parallel machine scheduling with machine availability and eligibility constraints, Machine scheduling with an availability constraint, Machine scheduling performance with maintenance and failure
