Publication:4238569
From MaRDI portal
zbMath0922.90088MaRDI QIDQ4238569
Marcos Singer, Michael L. Pinedo
Publication date: 16 August 1999
Related Items
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs, A tabu search heuristic for the quay crane scheduling problem, 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, Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops, A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective, Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics, Heuristic approaches for scheduling jobs in large-scale flexible job shops, A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Minimizing total weighted tardiness in a generalized job shop, Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication, Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm, 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, Study on constraint scheduling algorithm for job shop problems with multiple constraint machines, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, Minimizing value-at-risk in single-machine scheduling, Extended GRASP for the job shop scheduling problem with total weighted tardiness objective, The job shop scheduling problem with convex costs, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, Heuristics for minimizing total weighted tardiness in complex job shops, Heuristic factory planning algorithm for advanced planning and scheduling, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem, Measures of subproblem criticality in decomposition algorithms for shop scheduling, Heuristics for minimizing total weighted tardiness in flexible flow shops, A large step random walk for minimizing total weighted tardiness in a job shop, Applying machine based decomposition in 2-machine flow shops, On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming, Decomposition methods for large job shops, Semi-autonomous planning using linear programming in the Chilean General Treasury, A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops, Optimal planning of a multi-station system with sojourn time constraints
Cites Work
- Unnamed Item
- The one-machine sequencing problem
- On a routing problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- A Computational Study of the Job-Shop Scheduling Problem
- Job-Shop Scheduling by Implicit Enumeration
- 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
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Algorithms for Solving Production-Scheduling Problems
