Job shop scheduling with probabilistic durations

Simple item page
dc.contributor.authorBeck, J. Christopher
dc.contributor.authorWilson, Nic
dc.contributor.editorde Mántaras, Ramon López
dc.contributor.editorSaitta, Lorenza
dc.contributor.funderScience Foundation Irelanden
dc.contributor.funderILOG, USAen
dc.date.accessioned2020-11-10T13:04:46Z
dc.date.available2020-11-10T13:04:46Z
dc.date.issued2004-08
dc.date.updated2020-11-04T13:35:45Z
dc.description.abstractProactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule. In this paper, we investigate proactive approaches for the job shop scheduling problem where activity durations are random variables. The main contributions are (i) the introduction of the problem of finding probabilistic execution guarantees for difficult scheduling problems; (ii) a method for generating a lower bound on the minimal makespan; (iii) the development of the Monte Carlo approach for evaluating solutions; and (iv) the design and empirical analysis of three solution techniques: an approximately complete technique, found to be computationally feasible only for very small problems, and two techniques based on finding good solutions to a deterministic scheduling problem, which scale to much larger problems.en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationBeck, J. C. and Wilson, N. (2004) 'Job shop scheduling with probabilistic durations', ECAI'04: Proceedings of the 16th European Conference on Artificial Intelligence, 22- 27 August, Valencia, Spain: IOS Press, pp. 652–656.en
dc.identifier.endpage656en
dc.identifier.isbn978-1-58603-452-8
dc.identifier.startpage652en
dc.identifier.urihttps://hdl.handle.net/10468/10748
dc.language.isoenen
dc.publisherIOS Pressen
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/00/PI.1/C075/IE/Constraint Computation: Automation and Application/en
dc.relation.urihttps://dl.acm.org/doi/10.5555/3000001.3000139
dc.rights© 2004 IOS Pressen
dc.subjectSchedulingen
dc.subjectJob shop scheduling problemen
dc.subjectMonte Carlo approachen
dc.subjectScheduling problemen
dc.titleJob shop scheduling with probabilistic durationsen
dc.typeConference itemen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
jspuCRC.pdf
Size:
97.8 KB
Format:
Adobe Portable Document Format
Description:
Accepted version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Conference Items
Insight Centre for Data Analytics - Conference Items