On the Flow-Shop Sequencing Problem with No Wait in Process†
From MaRDI portal
Publication:5650547
DOI10.1057/jors.1972.52zbMath0238.90080OpenAlexW2077843935MaRDI QIDQ5650547
C. V. Ramamoorthy, Seenu S. Reddi
Publication date: 1972
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1972.52
Related Items (50)
Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ Some no-wait shops scheduling problems: Complexity aspect ⋮ Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study ⋮ Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ Scheduling in supply chain environment ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ Flow shop scheduling with peak power consumption constraints ⋮ On a scheduling problem in a robotized analytical system ⋮ Applications of max-plus algebra to flow shop scheduling problems ⋮ Two-machine stochastic flow shops with blocking and the traveling salesman problem ⋮ Flowshop sequencing problems with limited buffer storage ⋮ Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems ⋮ Two-machine interval shop scheduling with time lags ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices ⋮ Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. ⋮ No-wait flowshops with bicriteria of makespan and maximum lateness. ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ On Eulerian extensions and their application to no-wait flowshop scheduling ⋮ New heuristics for no-wait flowshops to minimize makespan. ⋮ Improved bounded dynamic programming algorithm for solving the blocking flow shop problem ⋮ Some new results in flow shop scheduling ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ The cyclic compact open-shop scheduling problem ⋮ An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ Scheduling two-machine no-wait open shops to minimize makespan ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Analysis of flow shop scheduling anomalies ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm ⋮ No-wait two-stage flowshop problem with multi-task flexibility of the first machine ⋮ Extensions of coloring models for scheduling purposes ⋮ An approximation algorithm for a bottleneck traveling salesman problem ⋮ Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost ⋮ An optimization-based heuristic for the robotic cell problem ⋮ No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Complexity of flowshop scheduling problems with a new blocking constraint ⋮ Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices ⋮ Small and large TSP: Two polynomially solvable cases of the traveling salesman problem ⋮ Optimal control of a class of DEDS: Flow-shops with state-dependent processing times ⋮ Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
This page was built for publication: On the Flow-Shop Sequencing Problem with No Wait in Process†
