Pages that link to "Item:Q811593"

The following pages link to Single machine flow-time scheduling with scheduled maintenance (Q811593):

Displaying 50 items.

• Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
• Patient scheduling with periodic deteriorating maintenance on single medical device (Q342021) (← links)
• Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
• Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• Integrated scheduling of production and delivery on a single machine with availability constraint (Q476906) (← links)
• Rescheduling for machine disruption to minimize makespan and maximum lateness (Q490326) (← links)
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← 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)
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
• Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323) (← 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)
• Supply chain scheduling problem in the hospital with periodic working time on a single machine (Q887873) (← 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)
• Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates (Q1652182) (← links)
• Maintenance scheduling problem with fuzzy random time windows on a single machine (Q1707500) (← links)
• Cost allocation in rescheduling with machine unavailable period (Q1754051) (← 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)
• Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• A note on minimizing total weighted completion time with an unexpected machine unavailable interval (Q2281620) (← links)
• Single-machine scheduling with job-dependent machine deterioration (Q2294893) (← links)
• Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance (Q2301137) (← 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)
• 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)
• Parallel-machine scheduling with potential disruption and positional-dependent processing times (Q2628178) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)