Pages that link to "Item:Q1284696"

The following pages link to Machine scheduling with availability constraints (Q1284696):

Displaying 50 items.

• Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
• Integrated production scheduling and maintenance policy for robustness in a single machine (Q337021) (← links)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• Scheduling jobs under increasing linear machine maintenance time (Q707693) (← links)
• Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint (Q850314) (← links)
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
• An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint (Q878557) (← links)
• New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
• Skilled workforce scheduling in service centres (Q954927) (← links)
• Online scheduling on semi-related machines (Q963475) (← links)
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
• Operator non-availability periods (Q1041405) (← links)
• Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
• Scheduling interfering job sets on parallel machines (Q1042099) (← links)
• Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
• Machine scheduling with a rate-modifying activity (Q1592740) (← links)
• Heuristics for two-machine no-wait flowshop scheduling with an availability constraint (Q1607139) (← links)
• Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates (Q1652182) (← links)
• Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
• Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
• Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← 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 resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862) (← links)
• Machine scheduling with contiguous processing constraints (Q2377238) (← links)
• Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265) (← 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)
• 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)
• Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures (Q2629648) (← links)
• Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
• Two-machine flow shop scheduling integrated with preventive maintenance planning (Q2795170) (← links)
• Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration (Q2958667) (← links)
• ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← 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)
• Basic scheduling problems with raw material constraints (Q3367034) (← links)
• Scheduling with periodic availability constraints and irregular cost functions (Q3598681) (← links)
• (Q4365136) (← links)
• Scheduling jobs in open shops with limited machine availability (Q4809658) (← links)