Priority rules for job shops with weighted tardiness costs
Management Science
The shifting bottleneck procedure for job shop scheduling
Management Science
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Decomposition methods for large job shops
Computers and Operations Research
A Computational Study of Shifting Bottleneck Procedures forShop Scheduling Problems
Journal of Heuristics
Preemption in single machine earliness/tardiness scheduling
Journal of Scheduling
Metaheuristics for Scheduling in Industrial and Manufacturing Applications
Metaheuristics for Scheduling in Industrial and Manufacturing Applications
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
INFORMS Journal on Computing
Computers and Industrial Engineering
Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Computers and Operations Research
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
Computers and Operations Research
Hi-index | 0.00 |
We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any objective function whose associated optimal timing problem can be expressed as a linear program (LP), and is particularly effective for objectives that include a component that is a function of individual operation completion times. Using the proposed heuristic framework, we address job shop scheduling problems with a variety of objectives where intermediate holding costs need to be explicitly considered. In computational testing, we demonstrate the performance of our proposed solution approach.