A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops

DOI10.1016/0305-0548(93)90083-UzbMATH Open0779.90043OpenAlexW1981936740MaRDI QIDQ1260741FDOQ1260741

Authors: Yeong-Dae Kim 

Publication date: 25 August 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90083-u

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

zbMATH Keywords

lower boundsbranch and boundtwo-machine flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Title not available (Why is that?)
• Optimal two- and three-stage production schedules with set-up time included
• On general routing problems
• Title not available (Why is that?)
• The two-machine flowshop scheduling problem with total tardiness
• A decomposition algorithm for the single machine total tardiness problem
• Focused Scheduling in Proportionate Flowshops
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• Generating improved dominance conditions for the flowshop problem
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• A new integer programming formulation for the permutation flowshop problem

Cited In (38)

• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Note on minimizing total tardiness in a two-machine flowshop
• Two-machine flowshop scheduling to minimize mean flow time
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• 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
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
• Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
• A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
• A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
• A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
• A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
• Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
• A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
• A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• Algorithms for a two‐machine flowshop problem with jobs of two classes
• An assignment-based lower bound for a class of two-machine flow shop problems
• Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
• 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
• Minimizing tardiness in a two-machine flow-shop
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing total tardiness in permutation flowshops
• Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
• Title not available (Why is that?)
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

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)