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

dc.citation.epage198en_US
dc.citation.issueNumber2en_US
dc.citation.spage188en_US
dc.citation.volumeNumber51en_US
dc.contributor.authorSarin, S. C.en_US
dc.contributor.authorErel, Erdalen_US
dc.contributor.authorSteiner, G.en_US
dc.date.accessioned2016-02-08T10:56:03Z
dc.date.available2016-02-08T10:56:03Z
dc.date.issued1991en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractThis 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.en_US
dc.identifier.doi10.1016/0377-2217(91)90249-Uen_US
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/26172
dc.language.isoEnglishen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/0377-2217(91)90249-Uen_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.subjectSingle machineen_US
dc.subjectStochastic schedulingen_US
dc.subjectComputer programming, algorithmsen_US
dc.subjectJob Analysis, computationen_US
dc.subjectProbability, random processesen_US
dc.subjectProduction engineering, schedulingen_US
dc.subjectJob sequencingen_US
dc.subjectSingle machine sequencingen_US
dc.subjectStochastic processing timesen_US
dc.subjectOperations researchen_US
dc.titleSequencing jobs on a single machine with a common due date and stochastic processing timesen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Sequencing_jobs_on_a_single_machine_with_a_common_due_date_and_stochastic_processing_times.pdf
Size:
560.9 KB
Format:
Adobe Portable Document Format
Description: