A Lower Bound for the Job Insertion Problem

  title={A Lower Bound for the Job Insertion Problem},
  author={Tam{\'a}s Kis and Alain Hertz},
  journal={Discrete Applied Mathematics},
This note deals with the job insertion problem in job-shop scheduling: Given a feasible schedule of n jobs and a new job which is not scheduled, the problem is to 3nd a feasible insertion of the new job into the schedule which minimises the makespan. Since the problem is NP-hard, a relaxation method is proposed to compute a strong lower bound. Conditions under which the relaxation provides us with the makespan of the optimal insertion are derived. After the analysis of the polytope of feasible… CONTINUE READING
7 Citations
24 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 24 references

Insertion techniques for job shop scheduling

  • T. Kis
  • Ph.D. Thesis, Ecole Polytechnique F& ed& erale…
  • 2001
Highly Influential
7 Excerpts

An integrated approach for modelling and solving the general multiprocessor jobshop scheduling problem using tabu search

  • A.
  • Hertz / Discrete Applied Mathematics
  • 2003

Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976

  • E. G. CoJman
  • /Discrete Applied Mathematics
  • 2003
1 Excerpt

EJective neighbourhood function for the Uexible job shop problem

  • M. Mastrolilli, L. M. Gambardella
  • J. Schedul. 3
  • 2000
2 Excerpts

Smutnicki , A fast taboo search algorithm for the jobshop problem , Management Sci

  • C. E. Nowicki
  • 2000

Chv & atal , On certain polytopes associated with graphs

  • V.
  • J . Combinat . Theory B
  • 1998

Multi-resource shop scheduling with resource Uexibility

  • S. DauzM ere-P, eres, W. Roux, J. B. Lasserre
  • European J. Oper. Res
  • 1998
2 Excerpts

Similar Papers

Loading similar papers…