Pages that link to "Item:Q1348546"

The following pages link to Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546):

Displaying 16 items.

• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232) (← links)
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
• Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• Two-machine flow shop total tardiness scheduling problem with deteriorating jobs (Q1930748) (← links)
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (Q2571194) (← links)
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times (Q3430247) (← links)
• A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks (Q6048111) (← links)
• A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)