Pages that link to "Item:Q757232"

The following pages link to Parallel machines scheduling with nonsimultaneous machine available time (Q757232):

Displaying 23 items.

• Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
• Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148) (← links)
• Machine scheduling with an availability constraint (Q2564885) (← links)
• Machine scheduling performance with maintenance and failure (Q2643755) (← links)
• Scheduling with deteriorating jobs and non-simultaneous machine available times (Q2788530) (← links)
• A semi-on-line scheduling problem of two parallel machines with common maintenance time (Q2920365) (← links)
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• A variation of Graham's LPT-algorithm (Q3989473) (← links)
• Linear compound algorithms for the partitioning problem (Q4526868) (← links)
• (Q4934199) (← links)
• Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines (Q5175957) (← links)
• Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints (Q5188149) (← links)
• (Q5260122) (← links)
• Algorithmic Applications in Management (Q5710115) (← links)
• Two-machine flow shops with limited machine availability (Q5953341) (← links)
• Single-machine scheduling with maintenance and repair rate-modifying activities (Q5955079) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)
• Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods (Q6090983) (← links)
• The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
• Multitasking scheduling with shared processing (Q6537208) (← links)
• Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost (Q6542992) (← links)
• Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines (Q6551117) (← links)