Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.

DOI10.1002/jos.94zbMath1115.90336OpenAlexW2067880102MaRDI QIDQ1347602

George Steiner, Jinliang Cheng, Paul Stephenson

Publication date: 27 July 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.94

zbMATH Keywords

latenessmakespanpermutation flow shoprelease times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

A robust approach for the single machine scheduling problem ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ A new sufficient condition of optimality for the two-machine flowshop problem

Cites Work

• An adaptive branching rule for the permutation flow-shop problem
• The one-machine sequencing problem
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
• Two branch and bound algorithms for the permutation flow shop problem
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Minimising makespan in the two-machine flow-shop with release times
• Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
• A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times

This page was built for publication: Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.