Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop

DOI10.1016/0377-2217(90)90244-6zbMath0689.90049OpenAlexW2060829858MaRDI QIDQ582206

Uttarayan Bagchi, Reza H. Ahmadi

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90244-6

zbMATH Keywords

machine schedulingflow shoplower boundssum of completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime ⋮ The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Flowshop sequencing with mean flowtime objective ⋮ A heuristic algorithm for mean flowtime objective in flowshop scheduling ⋮ A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ A flexible flowshop problem with total flow time minimization ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ The two-machine total completion time flow shop problem ⋮ Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

Cites Work

• Unnamed Item
• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Heuristic-Programming Solution of a Flowshop-Scheduling Problem