A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem

DOI10.1057/jors.1995.102zbMath0832.90058MaRDI QIDQ4849290

Jorge Haddock, Sunderesh S. Heragu, Amit Nagar

Publication date: 25 September 1995

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

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

zbMATH Keywords

simulated annealing; tabu search; branch-and-bound; genetic algorithms; computational analysis; two-machine flow shop scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Counting and enumeration complexity with application to multicriteria scheduling, A bicriteria flowshop scheduling with a learning effect, A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times, A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria, A bicriteria two-machine permutation flowshop problem, No-wait flowshops with bicriteria of makespan and maximum lateness., A bicriteria approach to the two-machine flow shop scheduling problem, An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem, The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime, Two-machine flowshop scheduling with a secondary criterion, Two-machine flow shop scheduling with two criteria: maximum earliness and makespan, A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem, Multicriteria scheduling, Genetic local search for multi-objective flowshop scheduling problems, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Multicriteria scheduling problems: a survey