Inequalities and Bounds in Stochastic Shop Scheduling | Zendy

Michael Pinedo | Zendy; Richard Weber | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Inequalities and Bounds in Stochastic Shop Scheduling

Author(s) -

Michael Pinedo,

Richard Weber

Publication year - 1984

Publication title -

siam journal on applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.954

H-Index - 99

eISSN - 1095-712X

pISSN - 0036-1399

DOI - 10.1137/0144062

Subject(s) - job shop scheduling , flow shop scheduling , scheduling (production processes) , mathematical optimization , computer science , mathematics , schedule , operating system

In this paper, stochastic shop models with m machines and n jobs are considered. A job has to be processed on all m machines, while certain constraints are imposed on the order of processing. The effect of the variability of the processing times on the expected completion time of the last job (the makespan) and on the sum of the expected completion times of all jobs (the flow time) is studied. Bounds are obtained for the expected makespan when the processing time distributions are New Better (Worse) than Used in Expectation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research