Pages that link to "Item:Q4006341"

The following pages link to V-Shaped Policies for Scheduling Deteriorating Jobs (Q4006341):

Displaying 50 items.

• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
• Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224) (← links)
• An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
• Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
• Some single-machine scheduling problems with general effects of learning and deterioration (Q630729) (← links)
• A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684) (← links)
• Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
• Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
• Scheduling with deteriorating jobs and learning effects (Q654684) (← links)
• A note on scheduling deteriorating jobs (Q814222) (← links)
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
• Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan (Q857361) (← links)
• How to collect balls moving in the Euclidean plane (Q860383) (← links)
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
• Patients scheduling problems with deferred deteriorated functions (Q887895) (← links)
• Flow shop scheduling with effects of learning and deterioration (Q949265) (← links)
• Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
• Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
• Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
• Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
• Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295) (← links)
• Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) (← links)
• A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems (Q1266600) (← links)
• On a scheduling problem of time deteriorating jobs (Q1271170) (← links)
• Scheduling jobs under simple linear deterioration (Q1332800) (← links)
• Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
• A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
• Minimizing the total weighted completion time of deteriorating jobs (Q1603525) (← links)
• Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration (Q1634051) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• Multi-machine scheduling with interval constrained position-dependent processing times (Q1716992) (← links)
• A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) (← links)
• Single machine scheduling problems with deteriorating jobs (Q1764739) (← links)
• Parallel machine scheduling with time dependent processing times (Q1923596) (← links)
• Minimizing total load on parallel machines with linear deterioration (Q2174916) (← links)
• Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects (Q2215199) (← links)
• New results for an open time-dependent scheduling problem (Q2215202) (← links)
• Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532) (← links)
• Single-machine scheduling with both deterioration and learning effects (Q2267309) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs (Q2399611) (← links)
• Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization (Q2402113) (← links)
• Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences (Q2433803) (← links)