Minimizing Cycle Time in a Blocking Flowshop
From MaRDI portal
Publication:4530646
Recommendations
- The complexity of scheduling jobs in repetitive manufacturing systems
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
- scientific article; zbMATH DE number 4076953
Cited in
(17)- Resolution of a scheduling problem in a flowshop robotic cell
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- Flowshop-scheduling problems with makespan criterion: a review
- Optimal versus heuristic scheduling of surface mount technology lines
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- A faster polynomial algorithm for 2-cyclic robotic scheduling
- An optimization-based heuristic for the robotic cell problem
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- Analysis of flow shop scheduling anomalies
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- scientific article; zbMATH DE number 5525237 (Why is no real title available?)
- On no-wait and no-idle flow shops with makespan criterion
- A review of TSP based approaches for flowshop scheduling
- Scheduling manufacturing systems with blocking: a Petri net approach
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
This page was built for publication: Minimizing Cycle Time in a Blocking Flowshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530646)
