Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 236, Issue 2, Pages 445-452Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2013.12.011
Keywords
Sequencing; Stochastic scheduling; Earliness/tardiness; Branch and bound; Neighborhood search; Due-date assignment
Ask authors/readers for more resources
We address the single-machine stochastic scheduling problem with an objective of minimizing total expected earliness and tardiness costs, assuming that processing times follow normal distributions and due dates are decisions. We develop a branch and bound algorithm to find optimal solutions to this problem and report the results of computational experiments. We also test some heuristic procedures and find that surprisingly good performance can be achieved by a list schedule followed by an adjacent pairwise interchange procedure. (c) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available