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

DOI10.1016/0305-0548(93)90083-UzbMath0779.90043OpenAlexW1981936740MaRDI QIDQ1260741

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

zbMATH Keywords

branch and bound lower bounds two-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)

Related Items

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

Cites Work