Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

Cited in

(41)

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

This page was built for publication: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740320)