Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates

DOI10.1111/itor.12421OpenAlexW2616485779MaRDI QIDQ6066663

Unnamed Author, Mehdi Mrad, Talel Ladhari, Anis Gharbi

Publication date: 16 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12421

zbMATH Keywords

lower boundsflowshopmixed integer linear programmingtotal completion timerelease date

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
• A mixed integer programming approach for the single machine problem with unequal release dates
• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
• A matheuristic approach for the two-machine total completion time flow shop problem
• Lower bounds for minimizing total completion time in a two-machine flow shop
• The two-machine total completion time flow shop problem
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• A local search algorithm for the flow shop scheduling problem with release dates
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• An efficient cost scaling algorithm for the assignment problem
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
• A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
• Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
• Scheduling
• Research on m‐machine flow shop scheduling with truncated learning effects

This page was built for publication: Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates