Pages that link to "Item:Q811593"
From MaRDI portal
The following pages link to Single machine flow-time scheduling with scheduled maintenance (Q811593):
Displayed 36 items.
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs (Q552454) (← links)
- Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance (Q703937) (← links)
- Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan (Q858282) (← links)
- Improved algorithms for two single machine scheduling problems (Q860871) (← links)
- Scheduling with tool changes to minimize total completion time under controllable machining conditions (Q868153) (← links)
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
- Machine scheduling with a rate-modifying activity (Q1592740) (← links)
- Match-up scheduling under a machine breakdown (Q1806884) (← links)
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763) (← links)
- Scheduling with limited machine availability (Q1969884) (← 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)
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan (Q2482821) (← links)
- Machine scheduling performance with maintenance and failure (Q2643755) (← links)
- An anticipative scheduling approach with controllable processing times (Q2654388) (← 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)
- (Q4934199) (← links)
- Scheduling with variable time slot costs (Q5189246) (← links)
- Single-machine scheduling with maintenance and repair rate-modifying activities (Q5955079) (← links)