Pages that link to "Item:Q2564885"

The following pages link to Machine scheduling with an availability constraint (Q2564885):

Displaying 50 items.

• Scheduling jobs with maintenance subject to load-dependent duration on a single machine (Q1664968) (← links)
• Parallel-machine scheduling with time-dependent and machine availability constraints (Q1667046) (← links)
• iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
• Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
• Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures (Q1688445) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← links)
• Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
• Match-up scheduling under a machine breakdown (Q1806884) (← links)
• Single-machine scheduling with periodic maintenance and nonresumable jobs. (Q1868816) (← links)
• Makespan minimization for two parallel machines with an availability constraint (Q1887910) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Scheduling with limited machine availability (Q1969884) (← links)
• Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
• Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery (Q2039713) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
• Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
• Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance (Q2156319) (← 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)
• Coordinated optimization of production scheduling and maintenance activities with machine reliability deterioration (Q2171074) (← links)
• An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
• Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← links)
• Bi-objective ant colony optimization approach to optimize production and maintenance scheduling (Q2270442) (← links)
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
• Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance (Q2301137) (← links)
• Rescheduling due to machine disruption to minimize the total weighted completion time (Q2317133) (← links)
• Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval (Q2346517) (← links)
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862) (← links)
• Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
• Equivalence of some different maintenance activities in single-machine scheduling (Q2422132) (← links)
• Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
• Single machine scheduling with small operator-non-availability periods (Q2434272) (← links)
• Parallel-machine scheduling under potential disruption (Q2465564) (← links)
• Multi-machine scheduling with deteriorating jobs and scheduled maintenance (Q2472931) (← links)
• Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan (Q2482821) (← links)
• Scheduling linear deteriorating jobs with an availability constraint on a single machine (Q2508968) (← links)
• Two-machine scheduling with periodic availability constraints to minimize makespan (Q2514681) (← links)
• Parallel-machine scheduling with potential disruption and positional-dependent processing times (Q2628178) (← 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)
• Machine scheduling performance with maintenance and failure (Q2643755) (← links)
• Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
• Multitasking scheduling with alternate periods (Q2697142) (← links)
• Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods (Q2798117) (← links)
• Combined production-maintenance decisions in situations with process deterioration (Q2872642) (← links)