Optimizing blocking flow shop scheduling problem with total completion time criterion
From MaRDI portal
Publication:336393
DOI10.1016/j.cor.2013.02.003zbMath1348.90294OpenAlexW1965147550MaRDI QIDQ336393
Danial Khorasanian, Ghasem Moslehi
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.003
schedulingbranch and boundtotal completion timeblocking flow shopmixed binary integer programming model
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
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 ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
Cites Work
- Unnamed Item
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- An optimization-based heuristic for the robotic cell problem
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Sequencing of jobs in some production system
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- Benchmarks for basic scheduling problems
- Optimal planning of part's machining on a number of machines
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Some new results in flow shop scheduling
- Flowshop sequencing problems with limited buffer storage
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Lower bounding schemes for flowshops with blocking in-process
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
