Ordonnancements à contraintes disjonctives
From MaRDI portal
Publication:4186067
DOI10.1051/ro/1978120403331zbMath0401.90052OpenAlexW2587256713MaRDI QIDQ4186067
Publication date: 1978
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104705
Related Items (38)
New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Scheduling jobs with release dates and tails on identical machines to minimize the makespan ⋮ Clustered enhanced differential evolution for the blocking flow shop scheduling problem ⋮ An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem ⋮ Refined ranking relations for selection of solutions in multi objective metaheuristics ⋮ A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates ⋮ Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm ⋮ Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem ⋮ An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ Single-machine scheduling with no idle time and release dates to~minimize a regular criterion ⋮ Approximative procedures for no-wait job shop scheduling. ⋮ 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 ⋮ No-wait job shop scheduling: tabu search and complexity of subproblems ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem ⋮ Flow shop scheduling with heterogeneous workers ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ Stochastic optimization using simulated annealing with hypothesis test ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm ⋮ Two branch and bound algorithms for the permutation flow shop problem ⋮ Forward Backward Transformation ⋮ Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates ⋮ Makespan preserving flowshop reengineering via blocking constraints ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach ⋮ On not-first/not-last conditions in disjunctive scheduling ⋮ The convergence of stochastic algorithms solving flow shop scheduling
This page was built for publication: Ordonnancements à contraintes disjonctives
