Pages that link to "Item:Q2564885"

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

Displaying 50 items.

• The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
• A scheduling problem with three competing agents (Q337134) (← links)
• Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate (Q337585) (← links)
• An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← 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)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← 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)
• Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← 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)
• Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance (Q703937) (← links)
• Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260) (← links)
• Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323) (← links)
• Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
• Makespan minimization for parallel machines scheduling with multiple availability constraints (Q744645) (← links)
• The coordination of single-machine scheduling with availability constraints and delivery (Q747044) (← links)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← 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)
• Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
• An integrated production and preventive maintenance planning model (Q877045) (← links)
• Supply chain scheduling problem in the hospital with periodic working time on a single machine (Q887873) (← links)
• A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
• An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs (Q898702) (← links)
• Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557) (← links)
• Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
• Job scheduling and management of wearing tools with stochastic tool lifetimes (Q955695) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• Makespan minimization for two parallel machines scheduling with a periodic availability constraint (Q1000962) (← links)
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine (Q1014400) (← links)
• A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' (Q1015007) (← links)
• Single machine scheduling with forbidden start times (Q1022436) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← 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)
• 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)
• Machine scheduling with availability constraints (Q1284696) (← 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)
• Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378) (← 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)