A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity

DOI10.1016/j.cor.2011.01.017zbMath1215.90030MaRDI QIDQ547125

Rym M'Hallah, Talal M. Al-Khamis

Publication date: 30 June 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.017

zbMATH Keywords

stochastic programming; parallel machine scheduling; ranking and selection; average sample approximation; weighted number of on-time jobs

Mathematics Subject Classification ID

90C15: Stochastic programming

90B36: Stochastic scheduling theory in operations research

Related Items

Single machine scheduling with release dates: a distributionally robust approach, An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization, A sample average approximation method for disassembly line balancing problem under uncertainty, On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty, A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees, Queue-constrained packing: a vehicle ferry case study, Optimal inventory policies for a two-dimensional stochastic inventory model: a numerical investigation, A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty

Uses Software

• SUTIL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• Minimizing the number of tardy jobs for \(m\) parallel machines
• A simulation-based approach to two-stage stochastic programming with recourse
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• The sample average approximation method applied to stochastic routing problems: a computational study
• Minimizing the weighted number of tardy jobs on parallel processors
• Stochastic scheduling on parallel machines to minimize discounted holding costs
• A stochastic programming approach for supply chain network design under uncertainty
• Scheduling with Deadlines and Loss Functions
• Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
• Parallel Machine Scheduling by Column Generation
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
• Sequencing with Earliness and Tardiness Penalties: A Review
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Solving Parallel Machine Scheduling Problems by Column Generation
• Stochastic Machine Scheduling with Precedence Constraints