Pages that link to "Item:Q869201"

The following pages link to Scheduling deteriorating jobs subject to job or machine availability constraints (Q869201):

Displaying 42 items.

• Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
• Scheduling a variable maintenance and linear deteriorating jobs on a single machine (Q458380) (← links)
• Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities (Q497936) (← links)
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← links)
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times (Q552424) (← links)
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration (Q613268) (← links)
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints (Q620936) (← links)
• Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities (Q623150) (← links)
• A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
• Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties (Q638880) (← links)
• Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
• Single-machine scheduling with a nonlinear deterioration function (Q656605) (← links)
• Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
• Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
• Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
• Single machine group scheduling with time dependent processing times and ready times (Q726558) (← links)
• Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time (Q727300) (← links)
• An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs (Q898702) (← links)
• A note on single-machine scheduling with decreasing time-dependent job processing times (Q967802) (← links)
• ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← 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 aging effect and upper-bounded actual processing times (Q1639804) (← links)
• Scheduling jobs with maintenance subject to load-dependent duration on a single machine (Q1664968) (← links)
• A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times (Q1758042) (← links)
• Complexity of scheduling with proportional deterioration and release dates (Q1787790) (← links)
• Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance (Q1926630) (← links)
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices (Q2190797) (← links)
• Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
• Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862) (← links)
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562) (← links)
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2379563) (← links)
• Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
• SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS (Q2920364) (← links)
• Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan (Q2956870) (← links)
• Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration (Q2958667) (← links)
• Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs (Q3004654) (← links)
• A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)