Decomposition methods for large job shops

DOI10.1016/S0305-0548(99)00098-2zbMath0964.90020MaRDI QIDQ1592580

Marcos Singer

Publication date: 4 July 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

rolling horizon heuristiclarge job shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling ⋮ A multi-criteria approach for scheduling semiconductor wafer fabrication facilities ⋮ Executing production schedules in the face of uncertainties: a review and some future directions ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ A linear programming-based method for job shop scheduling ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem ⋮ A prediction based iterative decomposition algorithm for scheduling large-scale job shops ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ Semi-autonomous planning using linear programming in the Chilean General Treasury ⋮ Optimal planning of a multi-station system with sojourn time constraints

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the job-shop scheduling problem
• Designing and reporting on computational experiments with heuristic methods
• A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
• On a routing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• A Broader View of the Job-Shop Scheduling Problem
• A Computational Study of the Job-Shop Scheduling Problem
• Needed: An Empirical Science of Algorithms
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• A modified shifting bottleneck procedure for job-shop scheduling
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Decomposition methods for large job shops