Minimising makespan in the two-machine flow-shop with release times

DOI10.1057/palgrave.jors.2600481zbMath1111.90319OpenAlexW2043344181MaRDI QIDQ3157644

Roberto Tadei, M. Cortesi, Jatinder N. D. Gupta, Frederico Della Croce

Publication date: 19 January 2005

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600481

zbMATH Keywords

branch and boundrelease timesflow-shop scheduling

Mathematics Subject Classification ID

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

Related Items (9)

Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Outsourcing and scheduling for a two-machine flow shop with release times ⋮ A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan ⋮ Generalized pairwise interchanges and machine scheduling ⋮ Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times ⋮ Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions ⋮ Mirror scheduling problems with early work and late work criteria

This page was built for publication: Minimising makespan in the two-machine flow-shop with release times