Sequencing jobs on a single machine with a common due date and stochastic processing times

Files

Sequencing_jobs_on_a_single_machine_with_a_common_due_date_and_stochastic_processing_times.pdf (560.9 KB)

Date

1991

Authors

Sarin, S. C.
Erel, Erdal
Steiner, G.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

European Journal of Operational Research

Print ISSN

0377-2217

Electronic ISSN

Publisher

Volume

51

Issue

2

Pages

188 - 198

Language

English

Type

Article

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
BUIR Usage Stats
2
views
18
downloads

Series

Abstract

This paper presents a procedure for sequencing jobs on a single machine with jobs having a common due date and stochastic processing times. The performance measure to be optimized is the expected incompletion cost. Job processing times are normally distributed random variables, and the variances of the processing times are proportional to their means. The optimal sequences are shown to have a W- or V-shape. Based on this property computationally attractive solution methods are presented.

Course

Other identifiers

Book Title

Keywords

Single machine, Stochastic scheduling, Computer programming, algorithms, Job Analysis, computation, Probability, random processes, Production engineering, scheduling, Job sequencing, Single machine sequencing, Stochastic processing times, Operations research

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/26172

Published Version (Please cite this version)

http://dx.doi.org/10.1016/0377-2217(91)90249-U

Collections

Scholarly Publications - Management