Pages that link to "Item:Q5939594"
From MaRDI portal
The following pages link to Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594):
Displaying 10 items.
- Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
- Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
- Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study (Q4602335) (← links)
