Pages that link to "Item:Q1111018"

The following pages link to Single machine flow-time scheduling with a single breakdown (Q1111018):

Displaying 36 items.

• Scheduling with limited machine availability (Q1969884) (← links)
• Solving the weighted capacitated planned maintenance problem and its variants (Q1991204) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
• Single-machine scheduling problems with machine aging effect and an optional maintenance activity (Q2293744) (← links)
• Single machine predictive scheduling using inserted idle times (Q2336320) (← links)
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343) (← links)
• Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint (Q2429001) (← links)
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
• Single machine scheduling under potential disruption (Q2457274) (← links)
• Parallel-machine scheduling under potential disruption (Q2465564) (← links)
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
• The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
• Machine scheduling with an availability constraint (Q2564885) (← links)
• Minimizing makespan on a single machine subject to random breakdowns (Q2583704) (← links)
• Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures (Q2629648) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• An anticipative scheduling approach with controllable processing times (Q2654388) (← links)
• Replication and sequencing of unreliable jobs on parallel machines (Q2669802) (← links)
• Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670) (← links)
• SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION (Q3013566) (← links)
• Single machine scheduling with preventive maintenances (Q3055653) (← links)
• Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792) (← links)
• Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs (Q3354454) (← links)
• STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS (Q3422739) (← links)
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES (Q3526523) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• (Q4934199) (← links)
• Single-machine scheduling subject to stochastic breakdowns (Q5202821) (← links)
• Integrated production planning and preventive maintenance in deteriorating production systems (Q5900277) (← links)
• Single-machine scheduling with maintenance and repair rate-modifying activities (Q5955079) (← links)
• Short‐term scheduling with machine calibration (Q6082198) (← 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)