Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects

DOI10.1287/opre.8.2.178zbMath0092.27910OpenAlexW2000777319MaRDI QIDQ3268384

No author found.

Publication date: 1960

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.8.2.178

zbMATH Keywords

set theory

Related Items (24)

Makespan distribution of permutation flowshop schedules ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Clustered enhanced differential evolution for the blocking 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 ⋮ 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 ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ Approximative procedures for no-wait job shop scheduling. ⋮ Improved bounded dynamic programming algorithm for solving the blocking flow shop problem ⋮ 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 ⋮ A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem ⋮ Auction-based approach to resolve the scheduling problem in the steel making process ⋮ Personal probabilities of probabilities ⋮ 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 ⋮ Optimal stopping rules for multinomial observations ⋮ Sevast'yanov's algorithm for the flow-shop scheduling problem ⋮ Forward Backward Transformation ⋮ Flowshop scheduling research after five decades ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach

This page was built for publication: Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects