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

Cited In (41)

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

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)