Pages that link to "Item:Q622157"

The following pages link to Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times (Q622157):

Displaying 16 items.

• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
• Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (Q336999) (← links)
• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
• Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
• Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
• Scheduling with job-splitting considering learning and the vital-few law (Q1652529) (← links)
• Multiple-machine scheduling with learning effects and cooperative games (Q1664951) (← links)
• Note on a single-machine scheduling problem with sum of processing times based learning and ready times (Q1665710) (← links)
• Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning (Q1667775) (← links)
• A genetic algorithm-based approach for single-machine scheduling with learning effect and release time (Q1717946) (← links)
• An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
• On interactive sequencing situations with exponential cost functions (Q2272301) (← links)
• Single-machine scheduling and due date assignment with rejection and position-dependent processing times (Q2438395) (← links)
• Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times (Q2511457) (← links)
• Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect (Q6191395) (← links)