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

Authors:
Talal Al-Khamis;Rym M'Hallah
Affiliations:
Department of Statistics and Operations Research, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait;Department of Statistics and Operations Research, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait
Venue:
Computers and Operations Research
Year:
2011

Citing 14
Cited 2

Sequencing with earliness and tardiness penalties: a review

Operations Research
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs

Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Minimizing the number of tardy jobs in identical machine scheduling

Proceedings of the 15th annual conference on Computers and industrial engineering
A simulation-based approach to two-stage stochastic programming with recourse

Mathematical Programming: Series A and B
The Sample Average Approximation Method for Stochastic Discrete Optimization

SIAM Journal on Optimization
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

Computational Optimization and Applications
Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs

Operations Research
Parallel Machine Scheduling by Column Generation

Operations Research
Solving Parallel Machine Scheduling Problems by Column Generation

INFORMS Journal on Computing
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

INFORMS Journal on Computing
Stochastic Machine Scheduling with Precedence Constraints

SIAM Journal on Computing
Stochastic scheduling on parallel machines to minimize discounted holding costs

Journal of Scheduling
Scaling up the sample average approximation method for stochastic optimization with applications to trading agents

AMEC'05 Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms
Monte Carlo bounding techniques for determining solution quality in stochastic programs

Operations Research Letters

An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees

Computers and Operations Research
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Part II: Parallelization

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a two-stage stochastic programming model for the parallel machine scheduling problem where the objective is to determine the machines' capacities that maximize the expected net profit of on-time jobs when the due dates are uncertain. The stochastic model decomposes the problem into two stages: The first (FS) determines the optimal capacities of the machines whereas the second (SS) computes an estimate of the expected profit of the on-time jobs for given machines' capacities. For a given sample of due dates, SS reduces to the deterministic parallel weighted number of on-time jobs problem which can be solved using the efficient branch and bound of M'Hallah and Bulfin [16]. FS is tackled using a sample average approximation (SAA) sampling approach which iteratively solves the problem for a number of random samples of due dates. SAA converges to the optimum in the expected sense as the sample size increases. In this implementation, SAA applies a ranking and selection procedure to obtain a good estimate of the expected profit with a reduced number of random samples. Extensive computational experiments show the efficacy of the stochastic model.