Pages that link to "Item:Q880500"

The following pages link to New single machine and job-shop scheduling problems with availability constraints (Q880500):

Displaying 11 items.

• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate (Q337585) (← links)
• Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
• Single machine scheduling with forbidden start times (Q1022436) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
• A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach (Q1730479) (← links)
• Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach (Q2241323) (← links)
• Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
• Single machine scheduling with small operator-non-availability periods (Q2434272) (← links)