Optimizing blocking flow shop scheduling problem with total completion time criterion
From MaRDI portal
Recommendations
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- The two-machine total completion time flow shop problem
- A flexible flowshop problem with total flow time minimization
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
Cites work
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- An optimization-based heuristic for the robotic cell problem
- Benchmarks for basic scheduling problems
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- Exact method for robotic cell problem
- Flowshop sequencing problems with limited buffer storage
- Lower bounding schemes for flowshops with blocking in-process
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Optimal planning of part's machining on a number of machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Sequencing of jobs in some production system
- Some new results in flow shop scheduling
Cited in
(13)- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- scientific article; zbMATH DE number 6719013 (Why is no real title available?)
- scientific article; zbMATH DE number 5525237 (Why is no real title available?)
- Lower bounding schemes for flowshops with blocking in-process
- scientific article; zbMATH DE number 2111620 (Why is no real title available?)
- Minimizing total completion time for flowshop scheduling problem with uncertain processing times
- Block multi-flow shop scheduling with complex buffers
- Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach
- Branch-and-bound-and-memorize for the blocking permutation flowshop problem
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
This page was built for publication: Optimizing blocking flow shop scheduling problem with total completion time criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336393)
