Corpus ID: 221379910

On Minimizing Lmax for Large-Scale, Job Shop Scheduling Problems

  title={On Minimizing Lmax for Large-Scale, Job Shop Scheduling Problems},
  author={S. Schultz},

Figures from this paper

A Probabilistic Characterization of Allocation Performance in a Worker-Constrained Job Shop
This chapter details a probabilistic method for evaluating the quality of a specific (but arbitrary) allocation in a given DRC job shop scheduling problem based on two recent articles by Lobo et al. Expand
Allocating job-shop manpower to minimize LMAX: Optimality criteria, search heuristics, and probabilistic quality metrics
This article establishes optimality criteria to verify that a given allocation corresponds to a schedule that yields the minimum value of LmaxLmax, the maximum job lateness, and estimates a probability distribution for evaluating the quality of an allocation delivered by a heuristic search procedure such as HSP. Expand
An effective lower bound on Lmax in a worker-constrained job shop
A procedure to compute a lower bound on L max that will be used in follow-up work to effectively evaluate the absolute performance of heuristic solutions and provide optimality criteria, and heuristics to find improved allocations if these criteria are not satisfied. Expand


Scheduling problems with due-date objectives and constraints, Unpublished Ph.D. dissertation
  • 2001
Scheduling problems with due-date objectives and constraints, Unpublished Ph.D. dissertation, North Carolina State University. VAN LAARHOVEN, P.J.M., E.H.L
  • AARTS, and J.K. LENSTRA,
  • 2001
A tabu search method guided by shifting bottleneck for the job shop scheduling problem
The proposed local search method is based on a tabu search technique and on the shifting bottleneck procedure used to generate the initial solution and to refine the next-current solutions. Expand
On satisfying due-dates in large job shops: idle time insertion
We consider the problem of minimizing maximum lateness in a job shop. A conceptually simple simulation based procedure described in a recent paper by Hodgson et al. [1] is modified to provideExpand
  • dates in large job shops. Management Science,
  • 2000
Some new results on simulated annealing applied to the job shop scheduling problem
  • M. Kolonko
  • Mathematics, Computer Science
  • Eur. J. Oper. Res.
  • 1999
A new approach is presented that uses a small population of SA runs in a genetic algorithm (GA) framework and yields excellent results on the classical test examples of the JSP. Expand
A controlled search simulated annealing method for the general job shop scheduling problem
  • 1998
Benchmarks for shop scheduling problems
In this paper we present extensive sets of randomly generated test problems for the problems of minimizing makespan (Cmax) and maximum lateness (Lmax) in flow shops and job shops. The 600 problemsExpand
Job Shop Scheduling With Deadlines
The objective is makespanminimization if there are no tardy jobs, and tardiness minimization otherwise, and the procedure is heuristic and exhibits a good trade-off between computing time and solution quality. Expand