Pages that link to "Item:Q1348391"

The following pages link to Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391):

Displaying 43 items.

• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← 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)
• A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
• A note on the complexity of flow-shop scheduling with deteriorating jobs (Q629368) (← links)
• Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
• Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs (Q733523) (← links)
• Isomorphic scheduling problems (Q744639) (← links)
• Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
• Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
• Total completion time in a two-machine flowshop with deteriorating tasks (Q928678) (← links)
• Flow shop scheduling with effects of learning and deterioration (Q949265) (← links)
• A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
• The Browne-Yechiali single-machine sequence is optimal for flow-shops (Q976013) (← links)
• Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
• ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) (← links)
• A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
• Single machine scheduling problems with deteriorating jobs (Q1764739) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem (Q2275945) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines (Q2370335) (← links)
• Single machine group scheduling under decreasing linear deterioration (Q2454982) (← links)
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint (Q2471238) (← links)
• Scheduling in a contaminated area: a model and polynomial algorithms (Q2491774) (← links)
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs (Q2514766) (← links)
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
• Makespan minimization on three-machine flow shop with deteriorating jobs (Q2873830) (← links)
• SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE (Q3103656) (← links)
• A job-shop scheduling model and its algorithm with machine deterioration (Q3194401) (← links)
• SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING (Q3439889) (← links)
• Scheduling deteriorating jobs with rejection on dominant machines (Q3640924) (← links)
• NP-hard cases in scheduling deteriorating jobs on dedicated machines (Q4658457) (← links)
• (Q4714493) (← links)
• Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
• Two-machine job shop scheduling with deteriorating jobs (Q5399741) (← links)
• A note on scheduling problems with learning effect and deteriorating jobs (Q5426620) (← links)
• A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs (Q5456312) (← links)