A flexible flowshop problem with total flow time minimization
From MaRDI portal
Recommendations
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
- scientific article; zbMATH DE number 1247725
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- Two-Stage Flowshop Scheduling Problem with Bicriteria
Cites work
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- A new heuristic for the n-job, M-machine flow-shop problem
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Branch and bound algorithm for the flow shop with multiple processors
- scientific article; zbMATH DE number 3425355 (Why is no real title available?)
- scientific article; zbMATH DE number 3466794 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
- The Complexity of Flowshop and Jobshop Scheduling
- Two-Stage, Hybrid Flowshop Scheduling Problem
Cited in
(27)- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- New heuristics for total tardiness minimization in a flexible flowshop
- The hybrid flow shop scheduling problem
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- A combination of flow shop scheduling and the shortest path problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
- scientific article; zbMATH DE number 4147845 (Why is no real title available?)
- scientific article; zbMATH DE number 4158358 (Why is no real title available?)
- Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
- scientific article; zbMATH DE number 6747350 (Why is no real title available?)
- scientific article; zbMATH DE number 975812 (Why is no real title available?)
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- scientific article; zbMATH DE number 6263663 (Why is no real title available?)
- Conceptual framework for lot-sizing and scheduling of flexible flow lines
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- Total flow time minimization in a flowshop sequence-dependent group scheduling problem
- Branch and bound algorithm for the flow shop with multiple processors
- A taxonomy of flexible flow line scheduling procedures
- Minimizing total flow time on a single flexible machine
This page was built for publication: A flexible flowshop problem with total flow time minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939584)
