Decomposition heuristics for robust job-shop scheduling

@article{Byeon1998DecompositionHF,
  title={Decomposition heuristics for robust job-shop scheduling},
  author={Eui-Seok Byeon and S. David Wu and Robert H. Storer},
  journal={IEEE Trans. Robotics and Automation},
  year={1998},
  volume={14},
  pages={303-313}
}
In this paper, we present an approach to weighted tardiness job-shop scheduling problems (JSP) using a graph decomposition technique. Our method decomposes a JSP into a series of sub-problems by solving a variant of the generalized assignment problem which we term "VAP". Given a specified assignment cost, VAP assigns operations to mutually exclusive and exhaustive subsets, identifying a partially specified schedule, Compared to a conventional, completely specified schedule, this partial… CONTINUE READING
BETA

Similar Papers

Figures, Tables, Results, and Topics from this paper.

Key Quantitative Results

  • We show that this iterative search approach is very effective, capable of improving schedule performance by more than 50%.

Citations

Publications citing this paper.
SHOWING 1-10 OF 22 CITATIONS

Operation decomposition and statistical bottleneck machine identification for large-scale job shop scheduling

  • 2008 Chinese Control and Decision Conference
  • 2008
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Improving scheduling robustness via preprocessing and dynamic adaptation

VIEW 4 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Genetic Algorithm for Job Shop Scheduling

Mr. P. P. Bhosale
  • 2016
VIEW 1 EXCERPT
CITES METHODS

Improved Variable Neighbourhood Search Algorithm for Robust Job Shop Scheduling Problems

  • 2016 8th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)
  • 2016

A hybrid approach to large-scale job shop scheduling

  • Applied Intelligence
  • 2008
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

Experimental investigation of scheduling rules in a dynamic job shop with weighted tardiness costs

E. Kutanoglu, I. Sabuncuoglu
  • Proc. 3rd Ind. Eng. Res. Conf., Atlanta, GA, May 1994.
  • 1994
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Experimental investigation of scheduling rules in a dynamic job shop with weighted tardiness costs

E. Kutanoglu, I. Sabuncuoglu
  • Proc. 3rd Ind. Eng. Res. Conf., Atlanta, GA, May 1994.
  • 1994
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A local search method for robust job shop scheduling via disjunctive graph decomposition

P. J. Brennan, S. D. Wu
  • Tech. Rep. 95T-006, Dept. IMSE, Lehigh Univ., Bethlehem, PA, 1995.
  • 1995
VIEW 1 EXCERPT

Predictable scheduling: An approach to reducing the effects of uncertainties on production schedules

S. V. Mehta, R. Uzsoy
  • Proc. 4th Industr. Eng. Res. Conf., Nashville, TN, May 1995.
  • 1995
VIEW 1 EXCERPT