Scheduling Independent Tasks with Deadlines on Semi-identical Processors
From MaRDI portal
Publication:3806974
DOI10.1057/jors.1988.44zbMath0657.90051OpenAlexW2011043187MaRDI 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
Related Items
Unnamed Item ⋮ Makespan minimization for two parallel machines with an availability constraint ⋮ Nearly on line scheduling of preemptive independent tasks ⋮ Single-machine scheduling with resource-dependent processing times and multiple unavailability periods ⋮ Scheduling jobs in open shops with limited machine availability ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ Machine scheduling performance with maintenance and failure ⋮ Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Scheduling with limited machine availability ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION ⋮ Scheduling with unexpected machine breakdowns ⋮ Two-machine flow shops with limited machine availability ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ Preemptive scheduling with variable profile, precedence constraints and due dates ⋮ Minimizing the sum of job completion times on capacitated two-parallel machines ⋮ Machine scheduling with an availability constraint ⋮ Two-machine flowshop scheduling with availability constraints ⋮ A new tabu search procedure for an audit-scheduling problem ⋮ Machine scheduling with a rate-modifying activity
This page was built for publication: Scheduling Independent Tasks with Deadlines on Semi-identical Processors
