Benchmarks for basic scheduling problems
From MaRDI portal
Publication:2366085
DOI10.1016/0377-2217(93)90182-MzbMath0769.90052WikidataQ56004684 ScholiaQ56004684MaRDI QIDQ2366085
Publication date: 29 June 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
makespanopen shopjob shopbenchmarkspermutation flow shopindustrial problemsrandomly generated scheduling problems
Related Items (only showing first 100 items - show all)
Makespan distribution of permutation flowshop schedules ⋮ Learning from planner performance ⋮ A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Clustered enhanced differential evolution for the blocking flow shop scheduling problem ⋮ New effective MILP models for PFSPs arising from real applications ⋮ MILP models for the optimization of real production lines ⋮ Permutation-induced acyclic networks for the job shop scheduling problem ⋮ Compiling finite linear CSP into SAT ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ Principles for the design of large neighborhood search ⋮ Refined ranking relations for selection of solutions in multi objective metaheuristics ⋮ Job-shop production scheduling with reverse flows ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ A real-time order acceptance and scheduling approach for permutation flow shop problems ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm ⋮ A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ An exact parallel method for a bi-objective permutation flowshop problem ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ Variability of completion time differences in permutation flow shop scheduling ⋮ Battery swap station location-routing problem with capacitated electric vehicles ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ 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 ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ A biased random key genetic algorithm for the field Technician scheduling problem ⋮ Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis) ⋮ An algorithm for the job shop scheduling problem based on global equilibrium search techniques ⋮ On optimizing a bi-objective flowshop scheduling problem in an uncertain environment ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ Parallel partitioning method (PPM): A new exact method to solve bi-objective problems ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times ⋮ A discrete version of particle swarm optimization for flowshop scheduling problems ⋮ A cooperative hyper-heuristic search framework ⋮ A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ Restart strategies in optimization: parallel and serial cases ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ Exact resolution of the two-stage hybrid flow shop with dedicated machines ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach ⋮ A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ The museum visitor routing problem ⋮ Minimizing total weighted flow time of a set of jobs with interval processing times ⋮ On the open-shop problem with preemption and minimizing the average completion time ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ A parallel multiple reference point approach for multi-objective optimization ⋮ Solving job shop scheduling problems utilizing the properties of backbone and ``big valley ⋮ A library of local search heuristics for the vehicle routing problem ⋮ An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ Synchronous flow shop scheduling with pliable jobs ⋮ Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems ⋮ Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness ⋮ A contribution and new heuristics for open shop scheduling ⋮ An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ Two branch and bound algorithms for the permutation flow shop problem ⋮ A genetic algorithm for flowshop scheduling with multiple objectives ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems ⋮ The distributed permutation flowshop scheduling problem ⋮ Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization ⋮ An integrated tabu search algorithm for the lot streaming problem in job shops ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case ⋮ Problem difficulty for tabu search in job-shop scheduling ⋮ Looking ahead with the pilot method ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- Constructive heuristic algorithms for the open shop problem
- An Algorithm for Solving the Job-Shop Problem
- Tabu Search—Part I
- A Computational Study of the Job-Shop Scheduling Problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
This page was built for publication: Benchmarks for basic scheduling problems
