Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
From MaRDI portal
Publication:4740320
DOI10.1002/nav.3800290311zbMath0504.90038OpenAlexW2070359938MaRDI QIDQ4740320
Publication date: 1982
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800290311
flowshop schedulingsum of completion timesno-idle or no-wait constraintpolynomial bounded algorithms
Related Items
Openshop and flowshop scheduling to minimize sum of completion times, A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems, Flowshop scheduling with dominant machines, A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem, A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion, On no-wait and no-idle flow shops with makespan criterion, Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time, Flow shop scheduling problems with decreasing linear deterioration under dominant machines, Applications of max-plus algebra to flow shop scheduling problems, Flowshop sequencing with mean flowtime objective, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, A heuristic algorithm for mean flowtime objective in flowshop scheduling, MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem, Benders decomposition for the mixed no-idle permutation flowshop scheduling problem, Total flowtime in no-wait flowshops with separated setup times., Solving the continuous flow-shop scheduling problem by metaheuristics., New heuristics for no-wait flowshops to minimize makespan., Minimizing Mean Completion Time for Special Flowshop Problems, Sensitivity analysis for some scheduling problems, Fitness landscape analysis for the no-wait flow-shop scheduling problem, A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion, A new heuristic and dominance relations for no-wait flowshops with setups, No-wait or no-idle permutation flowshop scheduling with dominating machines, Analysis of flow shop scheduling anomalies, A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion, Flowshop/no-idle scheduling to minimise the mean flowtime, Minimizing total completion time in two-machine flow shops with exact delays, Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs, A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion, COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM, Stochastically minimizing total flowtime in flowshops with no waiting space, The evolution of schematic representations of flow shop scheduling problems, Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines, The flow shop problem with no-idle constraints: a review and approximation, Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems, A two-machine no-wait flow shop problem with two competing agents, No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths, Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays, Nonpreemptive flowshop scheduling with machine dominance, Flowshop/no-idle scheduling to minimize total elapsed time
