A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk
Published 2018 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk
Authors
Keywords
Stochastic scheduling, Robust scheduling, Risk, Value-at-risk
Journal
Flexible Services and Manufacturing Journal
Volume -, Issue -, Pages -
Publisher
Springer Nature
Online
2018-06-23
DOI
10.1007/s10696-018-9316-z
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Minimizing value-at-risk in single-machine scheduling
- (2016) Semih Atakan et al. ANNALS OF OPERATIONS RESEARCH
- An estimation of distribution algorithm and new computational results for the stochastic resource-constrained project scheduling problem
- (2015) Chen Fang et al. Flexible Services and Manufacturing Journal
- A new graphical approach for solving single-machine scheduling problems approximately
- (2014) Evgeny R. Gafarov et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Considering skills evolutions in multi-skilled workforce allocation with flexible working hours
- (2014) El-Awady Attia et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Mitigating supply and production uncertainties with dynamic scheduling using real-time transport information
- (2014) Riccardo Mogre et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- A risk management-based evaluation of inventory allocations for make-to-order production
- (2013) Andreas M. Radke et al. CIRP ANNALS-MANUFACTURING TECHNOLOGY
- Effective and efficient scheduling of dynamic job shops—Combining the shifting bottleneck procedure with variable neighbourhood search
- (2013) Bernd Scholz-Reiter et al. CIRP ANNALS-MANUFACTURING TECHNOLOGY
- Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities
- (2013) Yunqiang Yin et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Design of flexible transfer lines: A case-based reconfiguration cost assessment
- (2013) Tullio Tolio et al. JOURNAL OF MANUFACTURING SYSTEMS
- A binary branch and bound algorithm to minimize maximum scheduling cost
- (2013) Charu Chandra et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- Scheduling with alternative routings in CNC workshops
- (2012) Youichi Nonaka et al. CIRP ANNALS-MANUFACTURING TECHNOLOGY
- Robust optimization for resource-constrained project scheduling with uncertain activity durations
- (2012) Christian Artigues et al. Flexible Services and Manufacturing Journal
- Stochastic single machine scheduling with random common due date
- (2012) Rachid Benmansour et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Robust production control against propagation of disruptions
- (2011) T. Tolio et al. CIRP ANNALS-MANUFACTURING TECHNOLOGY
- A two-stage stochastic programming project scheduling approach to production planning
- (2011) Arianna Alfieri et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Stochastic dominance and risk measure: A decision-theoretic foundation for VaR and C-VaR
- (2010) Chenghu Ma et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Customer's behaviour modelling for manufacturing planning
- (2010) S. Makris et al. INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
- A project scheduling approach to production planning with feeding precedence relations
- (2010) Arianna Alfieri et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- (2009) Zhixin Liu COMPUTERS & OPERATIONS RESEARCH
- Safe scheduling: Setting due dates in single-machine problems
- (2008) Kenneth R. Baker et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Stochastic scheduling to minimize expected maximum lateness
- (2007) Xianyi Wu et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started