Pages that link to "Item:Q3483073"

The following pages link to Scheduling Deteriorating Jobs on a Single Processor (Q3483073):

Displaying 50 items.

• Single machine group scheduling under decreasing linear deterioration (Q2454982) (← links)
• Single-machine group scheduling problems with deterioration consideration (Q2459398) (← links)
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times (Q2462556) (← links)
• Single-machine scheduling problems with past-sequence-dependent setup times (Q2467251) (← links)
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098) (← links)
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint (Q2471238) (← links)
• Multi-machine scheduling with deteriorating jobs and scheduled maintenance (Q2472931) (← links)
• Two scheduling problems in group technology with deteriorating jobs (Q2483767) (← links)
• Scheduling in a contaminated area: a model and polynomial algorithms (Q2491774) (← links)
• Scheduling linear deteriorating jobs with an availability constraint on a single machine (Q2508968) (← links)
• The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) (← links)
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
• An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
• Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
• A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times (Q2798129) (← links)
• Single-machine group scheduling problems with deteriorating and learning effect (Q2822286) (← links)
• An Optimal Single-Machine Scheduling with Linear Deterioration Rate and Rate-Modifying Activities (Q2867131) (← links)
• Makespan minimization on three-machine flow shop with deteriorating jobs (Q2873830) (← links)
• Scheduling position-based deteriorating jobs with multiple rate-modifying activities and past-sequence-dependent delivery times (Q2875636) (← 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)
• A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
• SINGLE MACHINE SCHEDULING WITH LINEAR DETERIORATING JOBS UNDER PREDICTIVE DISRUPTION (Q3013566) (← links)
• SCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES AND REJECTION (Q3166735) (← links)
• A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times (Q3439490) (← links)
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING (Q3439889) (← links)
• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine (Q3511376) (← links)
• Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning (Q3561750) (← links)
• Parallel machine scheduling problems with proportionally deteriorating jobs (Q3612784) (← links)
• V-Shaped Policies for Scheduling Deteriorating Jobs (Q4006341) (← links)
• Single-machine scheduling of stochastic jobs subject to deterioration or delay (Q4018277) (← links)
• Un ordonnancement dynamique de tâches stochastiques sur un seul processeur (Q4457894) (← links)
• Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
• A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times (Q5058834) (← links)
• Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities (Q5059237) (← links)
• Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255) (← links)
• Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology (Q5059395) (← 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)
• When Service Times Depend on Customers’ Delays: A Relationship Between Two Models of Dependence (Q5060506) (← links)
• Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects (Q5216798) (← links)
• DYNAMIC CONTROL OF A SINGLE-SERVER SYSTEM WHEN JOBS CHANGE STATUS (Q5242840) (← links)
• One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations (Q5252922) (← links)
• Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration (Q5255178) (← links)
• A note on the optimality of index priority rules for search and sequencing problems (Q5392799) (← links)
• A note on scheduling problems with learning effect and deteriorating jobs (Q5426620) (← links)
• A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance (Q5455039) (← links)
• An approximation algorithm for parallel machine scheduling with simple linear deterioration (Q5456305) (← links)
• Partial dominated schedules and minimizing the total completion time of deteriorating jobs (Q5746677) (← links)
• Minimizing maximum lateness under linear deterioration (Q5928447) (← links)