18 research outputs found
A linear programming-based method for job shop scheduling
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
Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem
An Enhanced Estimation of Distribution Algorithm for No-Wait Job Shop Scheduling Problem with Makespan Criterion
Combining Metaheuristics for the Job Shop Scheduling Problem with Sequence Dependent Setup Times
Murinization and H Chain Isotype Matching of the Anti-GITR Antibody DTA-1 Reduces Immunogenicity-Mediated Anaphylaxis in C57BL/6 Mice
Applying the fuzzy ranking method to the shifting bottleneck procedure to solve scheduling problems of uncertainty
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times
Preemption in single machine earliness-tardiness scheduling
We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Our solution approach is based on a time-indexed preemptive relaxation of the problem. For the objective function of this relaxation, we characterize cost coe±cients that are the best among those with a piecewise linear structure with two segments. From the solution to the relaxation with these best objective function coe±cients, we generate feasible solutions for the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach