Pages that link to "Item:Q5668232"

The following pages link to Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop (Q5668232):

Displaying 19 items.

• On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
• On optimizing a bi-objective flowshop scheduling problem in an uncertain environment (Q356401) (← links)
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time (Q980257) (← links)
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function (Q1129910) (← links)
• A contribution to the stochastic flow shop scheduling problem. (Q1410626) (← links)
• On three-machine flow shops with random job processing times (Q1580990) (← links)
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
• A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times (Q1789013) (← links)
• Stochastically minimizing the makespan in two-machine flow shops without blocking (Q1806913) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• Minimizing total expected costs in the two-machine, stochastic flow shop (Q1837103) (← links)
• Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity (Q1887781) (← links)
• Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times (Q2244222) (← links)
• Heuristic for stochastic online flowshop problem with preemption penalties (Q2312307) (← links)
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops (Q2563865) (← links)
• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times (Q3163137) (← links)
• Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times (Q3200873) (← links)
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times (Q6157771) (← links)