Pages that link to "Item:Q1887910"

The following pages link to Makespan minimization for two parallel machines with an availability constraint (Q1887910):

Displaying 17 items.

• Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling (Q300062) (← links)
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate (Q337585) (← links)
• Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260) (← links)
• Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint (Q1000962) (← links)
• A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' (Q1015007) (← links)
• Scheduling jobs with maintenance subject to load-dependent duration on a single machine (Q1664968) (← links)
• A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach (Q1730479) (← links)
• The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• Two-machine scheduling with periodic availability constraints to minimize makespan (Q2514681) (← links)
• ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints (Q5188149) (← links)
• Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (Q5879664) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)