A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
From MaRDI portal
(Redirected from Publication:1260741)
Recommendations
- Minimizing tardiness in a two-machine flow-shop
- Two-machine flowshop scheduling to minimize total tardiness
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
- Minimizing the total flow time and the tardiness in a two-machine flow shop
- Minimizing total tardiness in permutation flowshops
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A decomposition algorithm for the single machine total tardiness problem
- A new integer programming formulation for the permutation flowshop problem
- Focused Scheduling in Proportionate Flowshops
- Generating improved dominance conditions for the flowshop problem
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- On general routing problems
- Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
- Optimal two- and three-stage production schedules with set-up time included
- The two-machine flowshop scheduling problem with total tardiness
Cited in
(38)- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
- Minimizing the total flow time and the tardiness in a two-machine flow shop
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- An order scheduling problem with position-based learning effect
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times
- Two-machine flowshop scheduling to minimize mean flow time
- Minimizing tardiness in a two-machine flow-shop
- A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
- Minimizing total tardiness in permutation flowshops
- Note on minimizing total tardiness in a two-machine flowshop
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
- A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
- Algorithms for a two‐machine flowshop problem with jobs of two classes
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
- Minimizing total tardiness on a two-machine re-entrant flowshop
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
- Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
- A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
- scientific article; zbMATH DE number 6673363 (Why is no real title available?)
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- An assignment-based lower bound for a class of two-machine flow shop problems
- Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
This page was built for publication: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260741)
