Pages that link to "Item:Q3727729"

The following pages link to On Johnson's Two-Machine Flow Shop with Random Processing Times (Q3727729):

Displaying 31 items.

• 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)
• Job lateness in a two-machine flowshop with setup times separated (Q1184446) (← links)
• Scheduling in stochastic flowshops with independent setup, processing and removal times (Q1366705) (← links)
• An aggregation procedure for simulating manufacturing flow line models (Q1374035) (← 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)
• Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity (Q1887781) (← links)
• On the order of tandem queues (Q1908673) (← 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)
• Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
• Uncertainty measure for the Bellman-Johnson problem with interval processing times (Q2452733) (← links)
• Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops (Q2563865) (← links)
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
• A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
• Johnson's problem with stochastic processing times and optimal service level (Q2572849) (← links)
• (Q3077948) (← 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)
• (Q3740549) (← links)
• Inequalities for stochastic flow shops and job shops (Q3771946) (← links)
• A Probabilistic Analysis of Two-Machine Flowshops (Q4346342) (← links)
• A generalized Johnson's rule for stochastic assembly systems (Q4368526) (← links)
• Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops (Q4678208) (← links)
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops (Q5485388) (← links)
• Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times (Q6157771) (← links)